Basic perfect graphs and their extensions
From MaRDI portal
Publication:1779506
DOI10.1016/j.disc.2004.08.033zbMath1064.05130OpenAlexW2139950449MaRDI QIDQ1779506
Vadim E. Zverovich, Igor Edm. Zverovich
Publication date: 1 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.033
Related Items
All minimal prime extensions of hereditary classes of graphs ⋮ Substitution-closed pattern classes ⋮ A finiteness theorem for primal extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- Square-free perfect graphs.
- Extension of hereditary classes with substitutions
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Compositions for perfect graphs
- A finiteness theorem for primal extensions
- Normal hypergraphs and the perfect graph conjecture
- A Combinatorial Decomposition Theory
- Decomposition of Directed Graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph