Game-perfect semiorientations of forests

DOI10.7151/dmgt.2302zbMath1485.05113OpenAlexW3006008136MaRDI QIDQ2118241

Wai Lam Fong, Stephan Dominique Andres, Clément Charpentier

Publication date: 22 March 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2302

zbMATH Keywords

game chromatic numberforestdichromatic numberforbidden induced subdigraphgame-perfect digraphgame-perfect graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Game-perfect graphs
• Lightness of digraphs in surfaces and directed game chromatic number
• Asymmetric directed graph coloring games
• Perfect graphs are kernel solvable
• The game coloring number of planar graphs
• The dichromatic number of a digraph
• Game-perfect digraphs
• The strong game colouring number of directed graphs
• Game colouring directed graphs
• Miscellaneous Digraph Classes
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
• Perfect Digraphs
• Characterising and recognising game-perfect graphs