Introduction to competitive graph coloring

DOI10.1007/978-3-319-66065-3_5zbMATH Open1544.05035MaRDI QIDQ6599238

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

Publication date: 6 September 2024

zbMATH Keywords

graphscompetitive coloring

Mathematics Subject Classification ID

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

Cites Work

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

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)