Game-perfect graphs

DOI10.1007/s00186-008-0256-3zbMath1161.91331OpenAlexW4244422489MaRDI QIDQ1014302

Stephan Dominique Andres

Publication date: 27 April 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-008-0256-3

zbMATH Keywords

bipartite graphsperfect graphsgame chromatic number\(A\)-perfect\(B\)-perfectgame-perfect

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (6)

Game-perfect digraphs ⋮ Adapted game colouring of graphs ⋮ Autotopism stabilized colouring games on rook's graphs ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ Autoparatopism stabilized colouring games on rook's graphs ⋮ Game-perfect semiorientations of forests

Cites Work

• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Trivially perfect graphs
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm
• Relaxed game chromatic number of trees and outerplanar graphs
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III
• The game coloring number of pseudo partial \(k\)-trees
• Refined activation strategy for the marking game
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• Normal hypergraphs and the perfect graph conjecture
• Game chromatic index ofk-degenerate graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• The relaxed game chromatic number of outerplanar graphs
• A Note on "The Comparability Graph of a Tree"

This page was built for publication: Game-perfect graphs