Complete multipartite graphs and the relaxed coloring game
type: Item
instance of: scholarly article
title: Complete multipartite graphs and the relaxed coloring game
zbMATH Open document ID: 1252.05146
author: Charles Dunn
published in: Order
publication date: 2012-11-07T00:00:00Z
full work available at URL: https://digitalcommons.linfield.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6102616
zbMATH Keywords: competitive coloring
zbMATH Keywords: relaxed coloring
zbMATH Keywords: multipartite graphs
MaRDI profile type: Publication
OpenAlex ID: W1987099235
cites work: The Map-Coloring Game
cites work: Q4028100
cites work: Relaxed game chromatic number of graphs
cites work: A bound for the game chromatic number of graphs
cites work: A simple competitive graph coloring algorithm. II.
cites work: A simple competitive graph coloring algorithm. III
cites work: The relaxed game chromatic number of outerplanar graphs
cites work: Q4201568
cites work: Relaxed game chromatic number of trees and outerplanar graphs
cites work: A simple competitive graph coloring algorithm
DOI: 10.1007/S11083-011-9217-1
description: scientific article; zbMATH DE number 6102616