Complete multipartite graphs and the relaxed coloring game
From MaRDI portal
Publication:1757865
DOI10.1007/s11083-011-9217-1zbMath1252.05146MaRDI QIDQ1757865
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
91A43: Games involving graphs
05C15: Coloring of graphs and hypergraphs
05C07: Vertex degrees
05C57: Games on graphs (graph-theoretic aspects)
Related Items
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