Introduction to competitive graph coloring

DOI10.1007/978-3-319-66065-3_5MaRDI QIDQ6599238zbMATH OpenFDO

Authors C. Dunn, Vegard H. Larsen, J. F. Nordstrom

Publication date 6 September 2024

Full work available at URL https://doi.org/10.1007/978-3-319-66065-3_5

zbMATH Keywords

competitive coloringgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Recommendations

• A simple competitive graph coloring algorithm. III
• A simple competitive graph coloring algorithm. II.
• Asymmetric graph coloring games
• The Map-Coloring Game
• ON THE COMPLEXITY OF SOME COLORING GAMES

Cites work

• A bound for the game chromatic number of graphs
• A simple competitive graph coloring algorithm
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm. III
• Clique-relaxed graph coloring
• Complete multipartite graphs and the relaxed coloring game
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Every planar map is four colorable. II: Reducibility
• Game chromatic index of \(k\)-degenerate graphs
• Game chromatic number of outerplanar graphs
• scientific article; zbMATH DE number 139777 (Why is no real title available?)
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• Note on the game chromatic index of trees
• Radius two trees specify χ‐bounded classes
• Refined activation strategy for the marking game
• Relaxed coloring of a graph
• Relaxed game chromatic number of graphs
• Relaxed game chromatic number of trees and outerplanar graphs
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• The game chromatic number of trees and forests
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• The Map-Coloring Game
• The relaxed edge-coloring game and \(k\)-degenerate graphs
• The relaxed game chromatic index of k-degenerate graphs
• The relaxed game chromatic number of outerplanar graphs

This page was built for publication: Introduction to competitive graph coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599238)