Perfect Digraphs
From MaRDI portal
Publication:5251198
DOI10.1002/jgt.21811zbMath1312.05059OpenAlexW2486271905MaRDI QIDQ5251198
Winfried Hochstättler, Stephan Dominique Andres
Publication date: 22 May 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21811
clique numberperfect graphdichromatic numberperfect digraphBerge graphclique-acyclic superorientation
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Perfect graphs (05C17)
Related Items (14)
Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas ⋮ Acyclic coloring parameterized by directed clique-width ⋮ The digrundy number of digraphs ⋮ Digraphs and Variable Degeneracy ⋮ On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs ⋮ Strict chordal and strict split digraphs ⋮ A note on coloring digraphs of large girth ⋮ Perfect graphs with polynomially computable kernels ⋮ A semi-strong perfect digraph theorem ⋮ Hajós and Ore constructions for digraphs ⋮ Dichromatic number and forced subdivisions ⋮ Miscellaneous Digraph Classes ⋮ Point partition numbers: perfect graphs ⋮ Game-perfect semiorientations of forests
Cites Work
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- Perfect graphs are kernel solvable
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization.
- The dichromatic number of a digraph
- Perfect graphs, kernels, and cores of cooperative games
- Recognizing Berge graphs
- Normal hypergraphs and the perfect graph conjecture
- Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
- The circular chromatic number of a digraph
- Digraphs
- Finding an induced subdivision of a digraph
This page was built for publication: Perfect Digraphs
