3 search results - page 1 / 1 » List Colouring Constants of Triangle Free Graphs |
ENDM
2008
13 years 4 months ago
2008
WG
2010
Springer
13 years 3 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
COMBINATORICS
2006
13 years 4 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...