Graphical properties related to minimal imperfection
From MaRDI portal
Publication:1132889
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3390792 (Why is no real title available?)
- scientific article; zbMATH DE number 3420800 (Why is no real title available?)
- A characterization of perfect graphs
- A class of facet producing graphs for vertex packing polyhedra
- Almost integral polyhedra related to certain combinatorial optimization problems
- Anti-blocking polyhedra
- Blocking and anti-blocking pairs of polyhedra
- Coloring a Family of Circular Arcs
- Critical perfect graphs and perfect 3-chromatic graphs
- Line perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- On certain polytopes associated with graphs
- On the perfect graph conjecture
- On the strong perfect graph conjecture
- Perfect zero–one matrices
- The Strong Perfect Graph Conjecture for Planar Graphs
- The history of the perfect graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Cited in
(34)- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- Structure of cubic Lehman matrices
- An approach to solving \(A^{k}=J-I\)
- Some colouring problems for Paley graphs
- Near-perfect matrices
- Cayley partitionable graphs and near-factorizations of finite groups
- Two classes of perfect graphs
- Generalized perfect graphs: Characterizations and inversion
- A Sum of Squares Characterization of Perfect Graphs
- A note on even pairs
- On minimal imperfect graphs without induced P₅
- On classes of minimal circular-imperfect graphs
- Grinstead's conjecture is true for graphs with a small clique number
- A construction for non-rank facets of stable set polytopes of webs
- A classification of certain graphs with minimal imperfection properties
- On stable set polyhedra for K//(1,3)free graphs
- Vertex- and edge-minimal and locally minimal graphs
- Comparing imperfection ratio and imperfection index for graph classes
- A note on clutter partitions
- Applying Lehman's theorems to packing problems
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A vertex critical graph without critical edges
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- On transversals in minimal imperfect graphs
- Star-cutsets and perfect graphs
- Some properties of minimal imperfect graphs
- On the Laplacian spectrum of (\(\alpha,\omega\))-graphs
- On determining the imperfection ratio
- Minimal imperfect graphs: A simple approach
- Antitwins in partitionable graphs
- On perfect graphs and polyhedra with (0, 1)-valued extreme points
- On essential components and critical sets of a graph
- Forced color classes, intersection graphs and the strong perfect graph conjecture
- Completeness for intersection classes
This page was built for publication: Graphical properties related to minimal imperfection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132889)
