A characterization of perfect graphs

Cites work

Blocking and anti-blocking pairs of polyhedra

Cited in

(only showing first 100 items - show all)

On the linear extension complexity of stable set polytopes for perfect graphs
Combinatorial designs related to the strong perfect graph conjecture
Combinatorial symbolic powers
Critical perfect graphs and perfect 3-chromatic graphs
On the interval chromatic number of proper interval graphs
A description of claw-free perfect graphs
Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
C-perfect hypergraphs
New classes of Berge perfect graphs
The strong perfect graph conjecture for toroidal graphs
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
Tolerance graphs
Motivations and history of some of my conjectures
On a conjecture about uniquely colorable perfect graphs
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Stable effectivity functions and perfect graphs
About skew partitions in minimal imperfect graphs
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Perfect graphs are kernel solvable
Some remarks on Hajós' conjecture
Coloring perfect \((K_ 4\)-e)-free graphs
Perfect graphs, kernels, and cores of cooperative games
Graph imperfection. I
On the complexity of bandwidth allocation in radio networks
A min-max relation for the partial q-colourings of a graph. II: Box perfection
Some sequences associated with combinatorial structures
Almost integral polyhedra related to certain combinatorial optimization problems
A class of facet producing graphs for vertex packing polyhedra
Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
Even pairs in Berge graphs
The maximum vertex coverage problem on bipartite graphs
Generalized perfect graphs: Characterizations and inversion
Perfect \(0,\pm 1\) matrices
Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
On the Laplacian spectrum of (\(\alpha,\omega\))-graphs
The linear guessing number of undirected graphs
Computing clique and chromatic number of circular-perfect graphs in polynomial time
On certain polytopes associated with graphs
On classes of minimal circular-imperfect graphs
Complexity classification of some edge modification problems
Preperfect graphs
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Minimum weighted clique cover on claw‐free perfect graphs
Opposition graphs are strict quasi-parity graphs
Counterexamples to three conjectures concerning perfect graphs
On generalized perfect graphs: Bounded degree and bounded edge perfection
Star coloring of certain graph classes
Entropy of symmetric graphs
Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Vertex- and edge-minimal and locally minimal graphs
The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Coloring graphs with stable cutsets
A characterization of claw-free CIS graphs and new results on the order of CIS graphs
Edmonds polytopes and a hierarchy of combinatorial problems
Perfect graphs involving semitotal and semipaired domination
Antitwins in partitionable graphs
Trivially perfect graphs
Near-perfect matrices
A new property of critical imperfect graphs and some consequences
Perfect zero–one matrices
A family of perfect graphs associated with directed graphs
Finding a maximum independent set in a permutation graph
A survey of the algorithmic aspects of modular decomposition
Fractional kernels in digraphs
On the independence polynomial of the corona of graphs
Perfect commuting graphs
Vertex-transitive CIS graphs
Eternal domination and clique covering
On stable set polyhedra for K//(1,3)free graphs
Lehman matrices
Finite checkability for integer rounding properties in combinatorial programming problems
Handelman's hierarchy for the maximum stable set problem
Precoloring Extension III: Classes of Perfect Graphs
STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
An extension of Lehman's theorem and ideal set functions
Duality and perfection for edges in cliques
On circular critical graphs
Optimal parallel time bounds for the maximum clique problem on intervals
On the strong perfect graph conjecture
Line perfect graphs
Mock threshold graphs
On a geometric property of perfect graphs
A Sum of Squares Characterization of Perfect Graphs
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
The structure of imperfect critically strongly-imperfect graphs
On graphs with no induced five‐vertex path or paraglider
Completeness for intersection classes
?-Perfect graphs
Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
Coloring graph classes with no induced fork via perfect divisibility
Perfectness of normal products of graphs
Brambles and independent packings in chordal graphs
A note on clutter partitions
Chordal and perfect zero-divisor graphs of posets and applications to graphs associated with algebraic structures
The clique problem with multiple-choice constraints under a cycle-free dependency graph
Point partition numbers: perfect graphs
The story of perfectly orderable graphs
Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
On essential components and critical sets of a graph

This page was built for publication: A characterization of perfect graphs

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