On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers

DOI10.1016/j.disc.2019.01.012zbMath1407.05160OpenAlexW2914556036WikidataQ128495039 ScholiaQ128495039MaRDI QIDQ1732763

Ana Furtado, Clément Charpentier, Sylvain Gravier, Simone Dantas, Celina M. Herrera de Figueiredo

Publication date: 25 March 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.01.012

zbMATH Keywords

Nordhaus-Gaddum-type inequalitiescoloring gamemarking game

Mathematics Subject Classification ID

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

Related Items (1)

On a vertex-edge marking game on graphs

Cites Work

• The game coloring number of planar graphs
• Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
• Game domination number
• A survey of Nordhaus-Gaddum type relations
• Refined activation strategy for the marking game
• On Complementary Graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers