Game coloring the Cartesian product of graphs

DOI10.1002/JGT.20338zbMATH Open1223.05091OpenAlexW4241263391MaRDI QIDQ3605153FDOQ3605153

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

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

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)

Cites Work

• On acyclic colorings of planar graphs
• Acyclic colorings of planar graphs
• A bound for the game chromatic number of graphs
• Marking games and the oriented game chromatic number of partial \(k\)-trees
• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• The Map-Coloring Game
• Game chromatic number of Cartesian product graphs
• Competitive colorings of oriented graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• Very asymmetric marking games
• Radius two trees specify χ‐bounded classes
• Game list colouring of graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Orderings on graphs and game coloring number
• Weak acyclic coloring and asymmetric coloring games
• Excluding any graph as a minor allows a low tree-width 2-coloring
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm. III
• Acyclic colorings of products of trees

Cited In (25)

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

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)