The connectivity of minimal imperfect graphs
From MaRDI portal
(Redirected from Publication:4892346)
Recommendations
Cited in
(14)- Structure of cubic Lehman matrices
- Some aspects of minimal imperfect graphs
- An approach to solving \(A^{k}=J-I\)
- Quasi-star-cutsets and some consequences
- On minimal imperfect graphs without induced P₅
- Disjoint clique cutsets in graphs without long holes
- On partitionable, confidentially connected and unbreakable graphs
- From connectivity to coloring
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A Berge-keeping operation for graphs
- On strongly stable graphs and some consequences for partitionable graphs
- On minimal cutsets in P₅-free minimal imperfect graphs
- The Minset-Poset Approach to Representations of Graph Connectivity
- Connectivity, graph minors, and subgraph multiplicity
This page was built for publication: The connectivity of minimal imperfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4892346)