The connectivity of minimal imperfect graphs

DOI10.1002/(SICI)1097-0118(199609)23:1%3C77::AID-JGT9%3E3.0.CO;2-HMaRDI QIDQ4892346zbMATH OpenOpenAlexFDO

Authors András Sebö

Publication date 15 September 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199609)23:1%3C77::aid-jgt9%3E3.0.co;2-h

zbMATH Keywords

connectivitystable setminimal imperfect graphspartitionable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Some aspects of minimal imperfect graphs
• Complete multi-partite cutsets in minimal imperfect graphs
• On minimal cutsets in P₅-free minimal imperfect graphs
• On strongly stable graphs and some consequences for partitionable graphs
• On critical edges in minimal imperfect graphs

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)