Game coloring the Cartesian product of graphs

DOI10.1002/JGT.20338MaRDI QIDQ3605153zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

Publication date 20 February 2009

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20338

zbMATH Keywords

planar graphCartesian productgame chromatic numbergame coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Indicated coloring game on Cartesian products of graphs
• Game chromatic number of Cartesian product graphs
• Game chromatic number of Cartesian product graphs
• The game chromatic number of some families of Cartesian product graphs
• Game chromatic number of Cartesian and corona product graphs
• Indicated coloring of Cartesian product of graphs
• Coloring games on squares of graphs
• Game colouring of the square of graphs
• Game chromatic number of direct product of some families of graphs
• The game coloring number of planar graphs

Cites work

• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• 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
• Acyclic colorings of planar graphs
• Acyclic colorings of products of trees
• Competitive colorings of oriented graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Excluding any graph as a minor allows a low tree-width 2-coloring
• Game chromatic number of Cartesian product graphs
• Game chromatic number of outerplanar graphs
• Game list colouring of graphs
• Marking games and the oriented game chromatic number of partial \(k\)-trees
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On acyclic colorings of planar graphs
• Orderings on graphs and game coloring number
• Radius two trees specify χ‐bounded classes
• Refined activation strategy for the marking game
• The Map-Coloring Game
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• Very asymmetric marking games
• Weak acyclic coloring and asymmetric coloring games

Cited in

(25)

• Rainbow connection and graph products
• Colouring games based on autotopisms of Latin hyper-rectangles
• The graph distance game and some graph operations
• Autotopism stabilized colouring games on rook's graphs
• Adapted game colouring of graphs
• Two graph-colouring games
• Game colouring of the square of graphs
• Game chromatic number of Cartesian and corona product graphs
• Rainbow vertex-connection and graph products
• Proper connection number of graph products
• The orthogonal colouring game
• The game Grundy number of graphs
• The strong game colouring number of directed graphs
• Game chromatic number of Cartesian product graphs
• Circular game chromatic number of graphs
• Game chromatic number of toroidal grids
• Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
• Indicated coloring game on Cartesian products of graphs
• Game chromatic number of toroidal grids
• Game chromatic number of strong product graphs
• Game chromatic number of direct product of some families of graphs
• Game chromatic number of Cartesian product graphs
• Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
• The game chromatic number of some families of Cartesian product graphs
• The pre-hull number and lexicographic product

This page was built for publication: Game coloring the Cartesian product of graphs

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