A characterization of perfect graphs

Cites Work

Blocking and anti-blocking pairs of polyhedra

Cited In (only showing first 100 items - show all)

Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Some sequences associated with combinatorial structures
Maximal cliques in $\{P_{2} \cup P_{3},C_{4}\}$-free graphs
Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
Preperfect graphs
Counterexamples to three conjectures concerning perfect graphs
On generalized perfect graphs: Bounded degree and bounded edge perfection
On the independence polynomial of the corona of graphs
STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
Combinatorial symbolic powers
Optimal parallel time bounds for the maximum clique problem on intervals
On circular critical graphs
Handelman's hierarchy for the maximum stable set problem
Opposition graphs are strict quasi-parity graphs
Perfect graphs are kernel solvable
A new property of critical imperfect graphs and some consequences
Combinatorial designs related to the strong perfect graph conjecture
Tolerance graphs
Perfect zero–one matrices
Even pairs in Berge graphs
Near-perfect matrices
Graph imperfection. I
A class of facet producing graphs for vertex packing polyhedra
Finding a maximum independent set in a permutation graph
Critical perfect graphs and perfect 3-chromatic graphs
Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
Generalized perfect graphs: Characterizations and inversion
On certain polytopes associated with graphs
Perfect graphs involving semitotal and semipaired domination
Fractional kernels in digraphs
An extension of Lehman's theorem and ideal set functions
Trivially perfect graphs
The linear guessing number of undirected graphs
On classes of minimal circular-imperfect graphs
Duality and perfection for edges in cliques
Stable effectivity functions and perfect graphs
A characterization of claw-free CIS graphs and new results on the order of CIS graphs
Complexity classification of some edge modification problems
Coloring graphs with stable cutsets
Finite checkability for integer rounding properties in combinatorial programming problems
Lehman matrices
A description of claw-free perfect graphs
Coloring perfect $(K_ 4$-e)-free graphs
Star coloring of certain graph classes
On stable set polyhedra for K//(1,3)free graphs
New classes of Berge perfect graphs
Almost integral polyhedra related to certain combinatorial optimization problems
Vertex- and edge-minimal and locally minimal graphs
A survey of the algorithmic aspects of modular decomposition
Motivations and history of some of my conjectures
Perfect graphs, kernels, and cores of cooperative games
A min-max relation for the partial q-colourings of a graph. II: Box perfection
The maximum vertex coverage problem on bipartite graphs
Vertex-transitive CIS graphs
On the strong perfect graph conjecture
Linear chromatic bounds for a subfamily of $3K_{1}$-free graphs
On a conjecture about uniquely colorable perfect graphs
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Eternal domination and clique covering
Some remarks on Hajós' conjecture
Minimum weighted clique cover on claw‐free perfect graphs
On the linear extension complexity of stable set polytopes for perfect graphs
Not complementary connected and not CIS $d$-graphs form weakly monotone families
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
On the Laplacian spectrum of ($\alpha,\omega$)-graphs
A family of perfect graphs associated with directed graphs
On the complexity of bandwidth allocation in radio networks
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Computing clique and chromatic number of circular-perfect graphs in polynomial time
Precoloring Extension III: Classes of Perfect Graphs
On the interval chromatic number of proper interval graphs
The strong perfect graph conjecture for toroidal graphs
Antitwins in partitionable graphs
Line perfect graphs
C-perfect hypergraphs
Entropy of symmetric graphs
Edmonds polytopes and a hierarchy of combinatorial problems
The strong perfect-graph conjecture is true for $K_{1,3}$-free graphs
About skew partitions in minimal imperfect graphs
Perfect $0,\pm 1$ matrices
Perfect commuting graphs
Perfectness of normal products of graphs
Chordal 2-connected graphs and spanning trees
On the stability number of the edge intersection of two graphs.
Graphical properties related to minimal imperfection
New classes of perfect graphs
Problems and results on 1-cross-intersecting set pair systems
Non-regular square bipartite designs
A reduction procedure for coloring perfect $K_ 4$-free graphs
Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
Generalized non-coprime graphs of groups
Quasi-parity and perfect graphs
Independent set in $k$-claw-free graphs: conditional $\chi $-boundedness and the power of LP/SDP relaxations
Locally perfect graphs
Wings and perfect graphs
Point partition numbers: perfect graphs
Wide partitions, Latin tableaux, and Rota's basis conjecture
Forbidden induced pairs for perfectness and $\omega$-colourability of graphs
Coloring all directed paths in a symmetric tree, with an application to optical networks
Polynomial $\chi $-binding functions and forbidden induced subgraphs: a survey

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)