ON THE COMPLEXITY OF SOME COLORING GAMES
From MaRDI portal
Publication:3988839
DOI10.1142/S0129054191000091zbMath0753.05061MaRDI QIDQ3988839
Publication date: 28 June 1992
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
The complexity of coloring games on perfect graphs, Complexity of path-forming games, The game coloring number of planar graphs, Relaxed game chromatic number of trees and outerplanar graphs, Unnamed Item, Unnamed Item