Normal hypergraphs and the perfect graph conjecture. (Reprint)
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Perfect graphs and norms
- A characterization of normal fraternally orientable perfect graphs
- The normal graph conjecture for two classes of sparse graphs
- Polyhedral results on the stable set problem in graphs containing even or odd pairs
- Box-total dual integrality, box-integrality, and equimodular matrices
- Disproving the normal graph conjecture
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
- Normality of semigroups with some links to graph theory.
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
- scientific article; zbMATH DE number 3882481 (Why is no real title available?)
- scientific article; zbMATH DE number 3887740 (Why is no real title available?)
- scientific article; zbMATH DE number 14977 (Why is no real title available?)
- Norms and perfect graphs
- Non-separating subgraphs after deleting many disjoint paths
- Integral sum graphs G n and G -r,n are perfect graphs
- Changing induced subgraph isomorphisms under extended reconfiguration rules
- A weaker version of Lovász' path removal conjecture
This page was built for publication: Normal hypergraphs and the perfect graph conjecture. (Reprint)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497986)
