Equality perfect graphs and digraphs
From MaRDI portal
Recommendations
Cites work
- A simple competitive graph coloring algorithm
- Characterising and recognising game-perfect graphs
- Game chromatic index of \(k\)-degenerate graphs
- Game chromatic number of outerplanar graphs
- Game colouring directed graphs
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- Lightness of digraphs in surfaces and directed game chromatic number
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- On the game coloring index of \(F^+\)-decomposable graphs
- The coloring game on planar graphs with large girth, by a result on sparse cactuses
- The Comparability Graph of a Tree
- The dichromatic number of a digraph
- The game chromatic number and the game colouring number of cactuses
- The incidence game chromatic number of \((a,d)\)-decomposable graphs
- The Map-Coloring Game
- The Role of Elimination Trees in Sparse Factorization
- Trivially perfect graphs
Cited in
(5)
This page was built for publication: Equality perfect graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303537)