Game-perfect digraphs
type: Item
instance of: scholarly article
title: Game-perfect digraphs
zbMATH Open document ID: 1278.91026
author: Stephan Dominique Andres
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6137620
zbMATH Keywords: dichromatic number
zbMATH Keywords: digraph
zbMATH Keywords: game chromatic number
zbMATH Keywords: game-perfectness
zbMATH Keywords: perfect graph
zbMATH Keywords: quasi coloring
MaRDI profile type: Publication
full work available at URL: s00186-012-0401-x
OpenAlex ID: W2115478005
cites work: The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
cites work: Lightness of digraphs in surfaces and directed game chromatic number
cites work: Asymmetric directed graph coloring games
cites work: Game-perfect graphs
cites work: Directed defective asymmetric graph coloring games
cites work: Q5499922
cites work: Digraphs
cites work: Game chromatic number of Cartesian product graphs
cites work: Q4177597
cites work: ON THE COMPLEXITY OF SOME COLORING GAMES
cites work: The game chromatic number of random graphs
cites work: The circular chromatic number of a digraph
cites work: Game chromatic index of \(k\)-degenerate graphs
cites work: The strong perfect graph theorem
cites work: Note on the game chromatic index of trees
cites work: Game colouring of the square of graphs
cites work: Q4201568
cites work: Edge-partitions of planar graphs and their game coloring numbers
cites work: Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
cites work: A simple competitive graph coloring algorithm
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: On the oriented game chromatic number
cites work: The dichromatic number of a digraph
cites work: The game chromatic number and the game colouring number of cactuses
cites work: Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
cites work: Game colouring directed graphs
cites work: The game coloring number of pseudo partial \(k\)-trees
cites work: Refined activation strategy for the marking game
DOI: 10.1007/S00186-012-0401-X
Recommended article: Game-perfect graphs
Recommended article: Game-perfect semiorientations of forests
Recommended article: Game-perfect Graphs with Clique Number 2
Recommended article: Q3511139
Recommended article: Characterising and recognising game-perfect graphs
Recommended article: Q3303537
Recommended article: Asymmetric graph coloring games
Recommended article: Infinite chromatic games
Recommended article: Relaxed game chromatic number of graphs
Recommended article: A simple competitive graph coloring algorithm. III
description: scientific article; zbMATH DE number 6137620