On graphs with maximum difference between game chromatic number and chromatic number

DOI10.1016/J.DISC.2024.114271MaRDI QIDQ6646398

Lawrence Hollom

Publication date: 2 December 2024

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

zbMATH Keywords

graph colouringgames on graphsgame chromatic number

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• The game chromatic number and the game colouring number of cactuses
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• The game coloring number of planar graphs with a specific girth
• The game Grundy number of graphs
• The game coloring number of planar graphs with a given girth
• Hardness of variants of the graph coloring game
• PSPACE-completeness of two graph coloring games
• The difference between game chromatic number and chromatic number of graphs
• Refined activation strategy for the marking game
• Domination Game and an Imagination Strategy
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Radius two trees specify χ‐bounded classes
• The game chromatic number of random graphs
• On monotonicity in maker-breaker graph colouring games

This page was built for publication: On graphs with maximum difference between game chromatic number and chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646398)