20 search results - page 1 / 4 » Game List Colouring of Graphs |
56
Voted
COMBINATORICS
2007
15 years 13 days ago
2007
97
Voted
COMBINATORICS
2006
15 years 14 days ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
COMBINATORICS
2006
15 years 14 days 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 ...
JCT
2008
15 years 12 days ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
87
Voted
DM
2008
15 years 15 days ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...