Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers

DOI10.1016/j.disc.2005.08.009zbMath1086.05035OpenAlexW2156031008MaRDI QIDQ819816

Wei Fan Wang

Publication date: 29 March 2006

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

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

zbMATH Keywords

Euler characteristic

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Linear 2-arboricity of toroidal graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Edge-partition and star chromatic index ⋮ Marking Games

Cites Work

• Unnamed Item
• Unnamed Item
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• The game coloring number of pseudo partial \(k\)-trees
• Game chromatic index ofk-degenerate graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Structural theorem on plane graphs with application to the entire coloring number
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
• Edge-partitions of planar graphs and their game coloring numbers