Characterising and recognising game-perfect graphs

zbMath1411.05182arXiv1810.12439MaRDI QIDQ5377789

Dominique Andres, Edwin Lock

Publication date: 27 May 2019

Full work available at URL: https://arxiv.org/abs/1810.12439

zbMATH Keywords

perfect graphgame chromatic numbergraph colouring gamegame-perfect graphclique module decompositiondominating edge decompositionforbidden induced subgraph characterisation

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Unnamed Item ⋮ The connected greedy coloring game ⋮ \textsf{PSPACE}-hardness of variants of the graph coloring game ⋮ Game-perfect semiorientations of forests

This page was built for publication: Characterising and recognising game-perfect graphs