Game-perfect semiorientations of forests

DOI10.7151/DMGT.2302MaRDI QIDQ2118241zbMATH OpenOpenAlexFDO

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

Publication date 22 March 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

dichromatic numberforbidden induced subdigraphforestgame chromatic numbergame-perfect digraphgame-perfect graph

Mathematics Subject Classification ID

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

Recommendations

• Game-perfect digraphs
• scientific article; zbMATH DE number 5298418
• Game colouring directed graphs
• Directed defective asymmetric graph coloring games
• Equality perfect graphs and digraphs

Cites work

• Asymmetric directed graph coloring games
• Characterising and recognising game-perfect graphs
• Colouring games
• Game colouring directed graphs
• Game-perfect digraphs
• Game-perfect graphs
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• Lightness of digraphs in surfaces and directed game chromatic number
• Miscellaneous digraph classes
• On characterizing game-perfect graphs by forbidden induced subgraphs
• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Perfect digraphs
• Perfect graphs are kernel solvable
• The dichromatic number of a digraph
• The game coloring number of planar graphs
• The strong game colouring number of directed graphs
• The strong perfect graph theorem

Cited in

(6)

• Lightness of digraphs in surfaces and directed game chromatic number
• Marking games and the oriented game chromatic number of partial k-trees
• Game-perfect digraphs
• Game colouring directed graphs
• Equality perfect graphs and digraphs
• Directed defective asymmetric graph coloring games

This page was built for publication: Game-perfect semiorientations of forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118241)