Game-perfect graphs
From MaRDI portal
Publication:1014302
DOI10.1007/S00186-008-0256-3zbMATH Open1161.91331OpenAlexW4244422489MaRDI QIDQ1014302FDOQ1014302
Authors: 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
Recommendations
Cites Work
- Normal hypergraphs and the perfect graph conjecture
- The strong perfect graph theorem
- Trivially perfect graphs
- Title not available (Why is that?)
- Game chromatic number of outerplanar graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- A simple competitive graph coloring algorithm
- The game coloring number of pseudo partial \(k\)-trees
- Refined activation strategy for the marking game
- A Note on "The Comparability Graph of a Tree"
- Relaxed game chromatic number of graphs
- Game chromatic index of \(k\)-degenerate graphs
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- A simple competitive graph coloring algorithm. II.
- Relaxed game chromatic number of trees and outerplanar graphs
- A simple competitive graph coloring algorithm. III
- The relaxed game chromatic number of outerplanar graphs
- Title not available (Why is that?)
Cited In (20)
- Colouring games based on autotopisms of Latin hyper-rectangles
- Winner determination algorithms for graph games with matching structures
- Adapted game colouring of graphs
- Game-perfect semiorientations of forests
- Characterising and recognising game-perfect graphs
- Graph Theory and the Game of Sprouts
- Autotopism stabilized colouring games on rook's graphs
- Title not available (Why is that?)
- Game connectivity of graphs
- Games on interval and permutation graph representations
- Autoparatopism stabilized colouring games on rook's graphs
- On characterizing game-perfect graphs by forbidden induced subgraphs
- Graph Games and Reactive Synthesis
- Equality perfect graphs and digraphs
- The independence coloring game on graphs
- Game-perfect digraphs
- Online coloring a token graph
- The complexity of coloring games on perfect graphs
- Game-perfect Graphs with Clique Number 2
- Determining the results of tournament games using complete graphs generation
This page was built for publication: Game-perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014302)