| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 13430890 | Discrete Applied Mathematics | 2019 | 16 Pages |
Abstract
In this paper, we introduce and study the list version of incidence colouring. We determine the exact value of - or upper bounds on - the incidence choice number of several classes of graphs, namely square grids, Halin graphs, cactuses and Hamiltonian cubic graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Brahim Benmedjdoub, Isma Bouchemakh, Ãric Sopena,