Lightness of digraphs in surfaces and directed game chromatic number

DOI10.1016/j.disc.2007.12.060zbMath1225.05105OpenAlexW2033605485MaRDI QIDQ1025549

Stephan Dominique Andres

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.060

zbMATH Keywords

torusprojective planegirthKlein bottlegame chromatic numberforestplanar digraphgame colouring numberlightness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Unnamed Item ⋮ Game-perfect digraphs ⋮ The game chromatic number and the game colouring number of classes of oriented cactuses ⋮ The strong game colouring number of directed graphs ⋮ The game chromatic index of wheels ⋮ On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs ⋮ Directed defective asymmetric graph coloring games ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Asymmetric directed graph coloring games ⋮ Miscellaneous Digraph Classes ⋮ Game-perfect semiorientations of forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Nonorientable genus of nearly complete bipartite graphs
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• 103 graphs that are irreducible for the projective plane
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• The dichromatic number of a digraph
• The game coloring number of pseudo partial \(k\)-trees
• Joint extension of two theorems of Kotzig on 3-polytopes
• Refined activation strategy for the marking game
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• A kuratowski theorem for the projective plane
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Edge-partitions of planar graphs and their game coloring numbers
• On the oriented game chromatic number

This page was built for publication: Lightness of digraphs in surfaces and directed game chromatic number