Game-perfect digraphs

DOI10.1007/S00186-012-0401-XMaRDI QIDQ1935960zbMATH OpenOpenAlexFDO

Authors Stephan Dominique Andres

Publication date 20 February 2013

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

Full work available at URL https://doi.org/10.1007/s00186-012-0401-x

zbMATH Keywords

digraphperfect graphdichromatic numbergame chromatic numbergame-perfectnessquasi coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Games involving graphs (91A43)

Recommendations

• Game-perfect graphs
• Game-perfect semiorientations of forests
• Game-perfect Graphs with Clique Number 2
• scientific article; zbMATH DE number 5298418
• Characterising and recognising game-perfect graphs
• Equality perfect graphs and digraphs
• Asymmetric graph coloring games
• Infinite chromatic games
• Relaxed game chromatic number of graphs
• A simple competitive graph coloring algorithm. III

Cites work

• scientific article; zbMATH DE number 3613077 (Why is no real title available?)
• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• A simple competitive graph coloring algorithm
• Asymmetric directed graph coloring games
• Digraphs
• Directed defective asymmetric graph coloring games
• Edge-partitions of planar graphs and their game coloring numbers
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Game chromatic index of \(k\)-degenerate graphs
• Game chromatic number of Cartesian product graphs
• Game colouring directed graphs
• Game colouring of the square of graphs
• Game-perfect graphs
• Lightness of digraphs in surfaces and directed game chromatic number
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Normal hypergraphs and the perfect graph conjecture
• Note on the game chromatic index of trees
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On characterizing game-perfect graphs by forbidden induced subgraphs
• On the oriented game chromatic number
• Refined activation strategy for the marking game
• The circular chromatic number of a digraph
• The dichromatic number of a digraph
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• The game chromatic number and the game colouring number of cactuses
• The game chromatic number of random graphs
• The game coloring number of pseudo partial \(k\)-trees
• The strong perfect graph theorem

Cited in

(11)

• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
• Game-perfect semiorientations of forests
• Miscellaneous digraph classes
• The digrundy number of digraphs
• scientific article; zbMATH DE number 5298418 (Why is no real title available?)
• Game-perfect graphs
• Games without repetitions on digraphs
• Digraph competitions and cooperative games
• scientific article; zbMATH DE number 5379347 (Why is no real title available?)
• Equality perfect graphs and digraphs
• Game-perfect Graphs with Clique Number 2

This page was built for publication: Game-perfect digraphs

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