scientific article

zbMath1445.05068MaRDI QIDQ3303537

Stephan Dominique Andres

Publication date: 12 August 2020

Full work available at URL: https://cdm.ucalgary.ca/article/view/62672

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

game chromatic numbertrivially perfect graphgame colouring numbergame-perfect graphequality perfect digraphequality perfect graph

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Perfect graphs (05C17) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• The game chromatic number and the game colouring number of cactuses
• Lightness of digraphs in surfaces and directed game chromatic number
• Trivially perfect graphs
• A simple competitive graph coloring algorithm
• On the game coloring index of \(F^+\)-decomposable graphs
• The dichromatic number of a digraph
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• Game colouring directed graphs
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Game chromatic index ofk-degenerate graphs
• The Role of Elimination Trees in Sparse Factorization
• The Comparability Graph of a Tree
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Characterising and recognising game-perfect graphs
• The Map-Coloring Game

This page was built for publication: