Basic perfect graphs and their extensions
From MaRDI portal
Publication:1779506
DOI10.1016/J.DISC.2004.08.033zbMATH Open1064.05130OpenAlexW2139950449MaRDI QIDQ1779506FDOQ1779506
Authors: Vadim Zverovich, I.È. 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
Recommendations
Cites Work
- Extension of hereditary classes with substitutions
- Normal hypergraphs and the perfect graph conjecture
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- The strong perfect graph theorem
- Title not available (Why is that?)
- A Combinatorial Decomposition Theory
- Compositions for perfect graphs
- Decomposition of Directed Graphs
- Square-free perfect graphs.
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Title not available (Why is that?)
- A finiteness theorem for primal extensions
- Hereditary classes of line graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Basic perfect graphs and their extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779506)