Complete multipartite graphs and the relaxed coloring game

DOI10.1007/S11083-011-9217-1zbMath1252.05146OpenAlexW1987099235MaRDI QIDQ1757865

Charles Dunn

Publication date: 7 November 2012

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.linfield.edu/cgi/viewcontent.cgi?article=1001&context=mathfac_pubs

zbMATH Keywords

multipartite graphscompetitive coloringrelaxed coloring

Mathematics Subject Classification ID

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

Related Items (2)

Game chromatic number of direct product of some families of graphs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A bound for the game chromatic number of graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• The relaxed game chromatic number of outerplanar graphs
• The Map-Coloring Game

This page was built for publication: Complete multipartite graphs and the relaxed coloring game