The Map-Coloring Game

DOI10.1080/00029890.2007.11920471MaRDI QIDQ5448049zbMATH OpenOpenAlexWikidataFDO

Authors Tomasz Bartnicki, Jarosław Grytczuk, Xuding Zhu, H. A. Kierstead

Publication date 20 March 2008

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2007.11920471

zbMATH Keywords

coloring gamescomplexitygraph algorithmsgraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43)

Recommendations

• A simple competitive graph coloring algorithm. III
• scientific article; zbMATH DE number 431513
• scientific article; zbMATH DE number 398953
• Radius two trees specify χ‐bounded classes
• A simple competitive graph coloring algorithm. II.

Cited in

(57)

• Circular game chromatic number of graphs
• A simple competitive graph coloring algorithm. II.
• Majority coloring game
• A new upper bound on the game chromatic index of graphs
• Complete multipartite graphs and the relaxed coloring game
• Indicated coloring of graphs
• A simple competitive graph coloring algorithm. III
• The strong game colouring number of directed graphs
• The game Grundy number of graphs
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• Autotopism stabilized colouring games on rook's graphs
• Infinite chromatic games
• Game chromatic number of strong product graphs
• On game chromatic vertex-critical graphs
• A connected version of the graph coloring game
• Game chromatic number of some network graphs
• Indicated coloring game on Cartesian products of graphs
• Game chromatic number of generalized Petersen graphs and Jahangir graphs
• The difference between game chromatic number and chromatic number of graphs
• On the game chromatic number of splitting graphs of path and cycle
• The orthogonal colouring game
• 2-coloring number revisited
• Domination game: extremal families of graphs for \(3/5\)-conjectures
• Refined activation strategy for the marking game
• On a vertex-edge marking game on graphs
• The complexity of two colouring games
• Note on fair game edge-connectivity of graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• Strong chromatic index of sparse graphs
• Complexity of the game domination problem
• Equality perfect graphs and digraphs
• Game coloring the Cartesian product of graphs
• Impartial coloring games
• Game chromatic number of graphs with locally bounded number of cycles
• Coloring games on squares of graphs
• Adapted game colouring of graphs
• Radius two trees specify χ‐bounded classes
• The game Grundy indices of graphs
• Spanning-tree games
• The independence coloring game on graphs
• The coloring game on matroids
• Flow games
• Colouring games based on autotopisms of Latin hyper-rectangles
• The incidence game chromatic number of paths and subgraphs of wheels
• The two forests game and the four colour theorem
• Uniquely colorable graphs with equal chromatic and game chromatic numbers
• Game chromatic number of toroidal grids
• Nonrepetitive colorings of graphs
• Game chromatic number of Cartesian product graphs
• Game chromatic number of toroidal grids
• The game chromatic index of wheels
• Indicated domination game
• The cordiality game and the game cordiality number
• Introduction to competitive graph coloring
• Builder-blocker general position games
• Note on the game colouring number of powers of graphs
• A note on the game chromatic index of graphs

This page was built for publication: The Map-Coloring Game

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