Basic perfect graphs and their extensions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1186102 (Why is no real title available?)
- scientific article; zbMATH DE number 3675952 (Why is no real title available?)
- scientific article; zbMATH DE number 45231 (Why is no real title available?)
- scientific article; zbMATH DE number 781239 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A finiteness theorem for primal extensions
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Compositions for perfect graphs
- Decomposition of Directed Graphs
- Extension of hereditary classes with substitutions
- Hereditary classes of line graphs
- Normal hypergraphs and the perfect graph conjecture
- Square-free perfect graphs.
- The strong perfect graph theorem
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)