Game chromatic number of Cartesian product graphs

DOI10.1016/j.endm.2007.07.060zbMath1341.05088OpenAlexW2595169985MaRDI QIDQ5900078

Iztok Peterin

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://plus.si.cobiss.net/opac7/bib/14761305?lang=sl

zbMATH Keywords

game chromatic numberCartesian product graphsgame coloring number

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Acyclic colorings of products of trees
• A bound for the game chromatic number of graphs
• The game coloring number of pseudo partial \(k\)-trees
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• The Map-Coloring Game