Graphical properties related to minimal imperfection
From MaRDI portal
Publication:1132889
DOI10.1016/0012-365X(79)90065-7zbMath0421.05028MaRDI QIDQ1132889
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Integer programming (90C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Related Items
Near-perfect matrices ⋮ A note on clutter partitions ⋮ Perfect graphs with no \(P_ 5\) and no \(K_ 5\) ⋮ Comparing Imperfection Ratio and Imperfection Index for Graph Classes ⋮ Generalized perfect graphs: Characterizations and inversion ⋮ On transversals in minimal imperfect graphs ⋮ A construction for non-rank facets of stable set polytopes of webs ⋮ Two classes of perfect graphs ⋮ Star-cutsets and perfect graphs ⋮ On essential components and critical sets of a graph ⋮ On perfect graphs and polyhedra with (0, 1)-valued extreme points ⋮ Applying Lehman's theorems to packing problems ⋮ Some properties of minimal imperfect graphs ⋮ Minimal imperfect graphs: A simple approach ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ Grinstead's conjecture is true for graphs with a small clique number ⋮ An approach to solving \(A^{k}=J-I\) ⋮ A classification of certain graphs with minimal imperfection properties ⋮ Cayley partitionable graphs and near-factorizations of finite groups ⋮ On stable set polyhedra for K//(1,3)free graphs ⋮ Forced color classes, intersection graphs and the strong perfect graph conjecture ⋮ A vertex critical graph without critical edges ⋮ A note on even pairs ⋮ On classes of minimal circular-imperfect graphs ⋮ Antitwins in partitionable graphs ⋮ Structure of cubic Lehman matrices ⋮ Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ On minimal imperfect graphs without induced \(P_5\) ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Completeness for intersection classes ⋮ On determining the imperfection ratio ⋮ On the Laplacian spectrum of (\(\alpha,\omega\))-graphs ⋮ Some colouring problems for Paley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- A class of facet producing graphs for vertex packing polyhedra
- Almost integral polyhedra related to certain combinatorial optimization problems
- Critical perfect graphs and perfect 3-chromatic graphs
- On the perfect graph conjecture
- On certain polytopes associated with graphs
- The history of the perfect graphs
- Anti-blocking polyhedra
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Coloring a Family of Circular Arcs
- Line perfect graphs
- Perfect zero–one matrices
- The Strong Perfect Graph Conjecture for Planar Graphs
- Blocking and anti-blocking pairs of polyhedra
- On the strong perfect graph conjecture
This page was built for publication: Graphical properties related to minimal imperfection
