A classification of certain graphs with minimal imperfection properties

DOI10.1016/0012-365X(82)90296-5MaRDI QIDQ1160632zbMATH OpenFDO

Authors Sue Whitesides

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(82)90296-5

zbMATH Keywords

perfect graphs

Mathematics Subject Classification ID

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

Cites work

• A characterization of perfect graphs
• Coloring a Family of Circular Arcs
• Combinatorial designs and related systems
• Combinatorial designs related to the strong perfect graph conjecture
• Critical perfect graphs and perfect 3-chromatic graphs
• Graphical properties related to minimal imperfection
• scientific article; zbMATH DE number 3763984 (Why is no real title available?)
• scientific article; zbMATH DE number 3428942 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• On the existence of balanced bipartite designs. II
• On the strong perfect graph conjecture
• Perfect zero–one matrices
• Resolvable balanced bipartite designs
• The Strong Perfect Graph Conjecture for Planar Graphs
• The strong perfect graph conjecture for toroidal graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160632)