Game chromatic number of strong product graphs
From MaRDI portal
Publication:2092388
DOI10.1016/j.disc.2022.113162zbMath1502.05163OpenAlexW4295930327MaRDI QIDQ2092388
Hikoe Enomoto, Naoki Matsumoto, Jun Fujisawa
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113162
2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Game chromatic number of lexicographic product graphs
- The game chromatic number of some families of Cartesian product graphs
- The game coloring number of planar graphs
- Solution of the knight's Hamiltonian path problem on chessboards
- Coloring graph products---a survey
- Refined activation strategy for the marking game
- Game coloring the Cartesian product of graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Game chromatic number of outerplanar graphs
- Radius two trees specify χ‐bounded classes
- The Map-Coloring Game
- Game chromatic number of toroidal grids
- Game chromatic number of Cartesian product graphs