Game chromatic number of Cartesian product graphs
From MaRDI portal
Recommendations
- 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
- Game chromatic number of strong product graphs
- Game chromatic number of lexicographic product graphs
- Game chromatic number of direct product of some families of graphs
- Game coloring the Cartesian product of graphs
- The game chromatic and chromatic number of some graphs
- Game chromatic number of some network graphs
- Game chromatic number of outerplanar graphs
Cites work
- A bound for the game chromatic number of graphs
- Acyclic colorings of products of trees
- Game chromatic number of outerplanar graphs
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- Radius two trees specify χ‐bounded classes
- The game coloring number of pseudo partial \(k\)-trees
- The Map-Coloring Game
Cited in
(10)- Game chromatic number of strong product graphs
- Game chromatic number of lexicographic product graphs
- Game chromatic number of direct product of some families of graphs
- Game coloring the Cartesian product of graphs
- The game chromatic number of corona of two graphs
- Game chromatic number of Cartesian and corona product graphs
- Game chromatic number of toroidal grids
- 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
This page was built for publication: Game chromatic number of Cartesian product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900078)