-
2
-
-
0026993954
-
The complexity of coloring games on perfect graphs
-
H.L. Bodlaender and D. Kratsch, The complexity of coloring games on perfect graphs, Theoret. Comput. Sci. 106 (1992), 309-326.
-
(1992)
Theoret. Comput. Sci.
, vol.106
, pp. 309-326
-
-
Bodlaender, H.L.1
Kratsch, D.2
-
3
-
-
49249149212
-
On acyclic colorings of planar graphs
-
O. Borodin, On acyclic colorings of planar graphs, Discrete Math. 25 (1979), 211-236.
-
(1979)
Discrete Math.
, vol.25
, pp. 211-236
-
-
Borodin, O.1
-
5
-
-
0038621187
-
Game chromatic number of graphs
-
T. Dinski and X. Zhu, Game chromatic number of graphs, Discrete Math. 196 (1999), 109-115.
-
(1999)
Discrete Math.
, vol.196
, pp. 109-115
-
-
Dinski, T.1
Zhu, X.2
-
6
-
-
0040098428
-
On a problem in graph theory
-
P. Erdös, On a problem in graph theory, Math. Gaz. 47 (1963), 220-223.
-
(1963)
Math. Gaz.
, vol.47
, pp. 220-223
-
-
Erdös, P.1
-
7
-
-
0038621183
-
On the game chromatic number of some classes of graphs
-
U. Faigle, U. Kern, H.A. Kierstead and W.T. Trotter, On the game chromatic number of some classes of graphs, Ars Combinatoria 35 (1993), 143-150.
-
(1993)
Ars Combinatoria
, vol.35
, pp. 143-150
-
-
Faigle, U.1
Kern, U.2
Kierstead, H.A.3
Trotter, W.T.4
-
8
-
-
0033477109
-
The game chromatic number of outerplanar graphs
-
D. Guan and X. Zhu, The game chromatic number of outerplanar graphs, J. Graph Theory 30 (1999), 67-70.
-
(1999)
J. Graph Theory
, vol.30
, pp. 67-70
-
-
Guan, D.1
Zhu, X.2
-
9
-
-
0037944981
-
A simple competitive graph coloring algorithm
-
H.A. Kierstead, A simple competitive graph coloring algorithm, J. Combin. Theory Ser. B (2000), 57-68.
-
(2000)
J. Combin. Theory Ser. B
, pp. 57-68
-
-
Kierstead, H.A.1
-
10
-
-
4043129804
-
-
personal communication
-
H.A. Kierstead, personal communication.
-
-
-
Kierstead, H.A.1
-
11
-
-
84987487282
-
Planar graph coloring with an uncooperative partner
-
H.A. Kierstead and W.T. Trotter, Planar graph coloring with an uncooperative partner, J. Graph Theory 18-6 (1994), 569-584.
-
(1994)
J. Graph Theory
, vol.18
, Issue.6
, pp. 569-584
-
-
Kierstead, H.A.1
Trotter, W.T.2
-
13
-
-
0003894228
-
-
Holt, Rinehart and Winston, New York
-
J.W. Moon, Topics on tournaments, Holt, Rinehart and Winston, New York (1968).
-
(1968)
Topics on Tournaments
-
-
Moon, J.W.1
-
14
-
-
4043095778
-
On four coloring problems
-
Charles University, Prague
-
J. Nešetřil and E. Sopena, On four coloring problems, KAM-DIMATIA Series 99-418, Charles University, Prague.
-
KAM-DIMATIA Series
, pp. 99-418
-
-
Nešetřil, J.1
Sopena, E.2
-
15
-
-
0028480028
-
Good and semi-strong colorings of oriented planar graphs
-
A. Raspaud and E. Sopena, Good and semi-strong colorings of oriented planar graphs, Inform. Processing Letters 51 (1994), 171-174.
-
(1994)
Inform. Processing Letters
, vol.51
, pp. 171-174
-
-
Raspaud, A.1
Sopena, E.2
-
16
-
-
0031477218
-
On the chromatic number of oriented graphs
-
E. Sopena, On the chromatic number of oriented graphs, J. Graph Theory 25 (1997), 191-205.
-
(1997)
J. Graph Theory
, vol.25
, pp. 191-205
-
-
Sopena, E.1
-
17
-
-
0038621143
-
The game coloring number of planar graphs
-
X. Zhu, The game coloring number of planar graphs, J. Combin. Theory Ser. B 75 (1999), 245-258.
-
(1999)
J. Combin. Theory Ser. B
, vol.75
, pp. 245-258
-
-
Zhu, X.1
|