Game coloring the Cartesian product of graphs
From MaRDI portal
Publication:3605153
DOI10.1002/jgt.20338zbMath1223.05091OpenAlexW4241263391MaRDI QIDQ3605153
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
Related Items (20)
The graph distance game and some graph operations ⋮ 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 ⋮ Unnamed Item ⋮ Graph colorings with restricted bicolored subgraphs: II. The graph coloring game ⋮ Adapted game colouring of graphs ⋮ The strong game colouring number of directed graphs ⋮ The pre-hull number and lexicographic product ⋮ The game Grundy number of graphs ⋮ Proper connection number of graph products ⋮ Indicated coloring game on Cartesian products of graphs ⋮ Game chromatic number of toroidal grids ⋮ Game chromatic number of toroidal grids ⋮ Rainbow vertex-connection and graph products ⋮ Rainbow connection and graph products ⋮ Autotopism stabilized colouring games on rook's graphs ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ Circular game chromatic number of graphs ⋮ Game colouring of the square of graphs ⋮ Game chromatic number of strong product graphs
Cites Work
- Unnamed Item
- Acyclic colorings of products of trees
- Game list colouring of graphs
- On acyclic colorings of planar graphs
- A bound for the game chromatic number of graphs
- The game coloring number of planar graphs
- Marking games and the oriented game chromatic number of partial \(k\)-trees
- A simple competitive graph coloring algorithm. II.
- A simple competitive graph coloring algorithm
- Orderings on graphs and game coloring number
- Excluding any graph as a minor allows a low tree-width 2-coloring
- A simple competitive graph coloring algorithm. III
- The game coloring number of pseudo partial \(k\)-trees
- Refined activation strategy for the marking game
- Weak acyclic coloring and asymmetric coloring games
- Very asymmetric marking games
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Game chromatic number of outerplanar graphs
- Radius two trees specify χ‐bounded classes
- Edge-partitions of planar graphs and their game coloring numbers
- The Map-Coloring Game
- Game chromatic number of Cartesian product graphs
- Acyclic colorings of planar graphs
- Competitive colorings of oriented graphs
This page was built for publication: Game coloring the Cartesian product of graphs