On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs

DOI10.1016/j.akcej.2019.03.020zbMath1473.05201OpenAlexW2930224034MaRDI QIDQ5154626

Stephan Dominique Andres

Publication date: 5 October 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.03.020

zbMATH Keywords

kernelgame chromatic numberperfect digraphgame-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) Perfect graphs (05C17) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Game-perfect semiorientations of forests

Cites Work

• Unnamed Item
• Richardson's theorem in \(H\)-coloured digraphs
• The strong perfect graph theorem
• Lightness of digraphs in surfaces and directed game chromatic number
• Perfect graphs are kernel solvable
• The ellipsoid method and its consequences in combinatorial optimization
• Combinatorial game theory foundations applied to digraph kernels
• The dichromatic number of a digraph
• Algorithmic graph theory and perfect graphs
• Game-perfect digraphs
• The strong game colouring number of directed graphs
• Game colouring directed graphs
• Perfect graphs, kernels, and cores of cooperative games
• Normal hypergraphs and the perfect graph conjecture
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The circular chromatic number of a digraph
• Perfect Digraphs
• Digraphs

This page was built for publication: On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs