A classification of certain graphs with minimal imperfection properties

DOI10.1016/0012-365X(82)90296-5zbMath0478.05055MaRDI QIDQ1160632

S. H. Whitesides

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ Structure of cubic Lehman matrices

Cites Work

• Graphical properties related to minimal imperfection
• The strong perfect graph conjecture for toroidal graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Resolvable balanced bipartite designs
• Critical perfect graphs and perfect 3-chromatic graphs
• Combinatorial designs related to the strong perfect graph conjecture
• On the existence of balanced bipartite designs. II
• Combinatorial designs and related systems
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Coloring a Family of Circular Arcs
• Perfect zero–one matrices
• The Strong Perfect Graph Conjecture for Planar Graphs
• On the strong perfect graph conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: A classification of certain graphs with minimal imperfection properties