A characterization of perfect graphs

Cites work

Blocking and anti-blocking pairs of polyhedra

Cited in

(only showing first 100 items - show all)

The maximum vertex coverage problem on bipartite graphs
Brambles and independent packings in chordal graphs
Vertex-transitive CIS graphs
Structural properties of Toeplitz graphs
On circular-perfect graphs: a survey
Perfect graph decompositions
Short-chorded and perfect graphs
Perfect graphs and norms
Finite-type invariants for graphs and graph reconstructions
Norms and perfect graphs
A note on clutter partitions
Linear chromatic bounds for a subfamily of $3K_{1}$-free graphs
On the strong perfect graph conjecture
The strong perfect graph conjecture: 40 years of attempts, and its resolution
On a conjecture about uniquely colorable perfect graphs
Maximal ambiguously $k$-colorable graphs
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
Random perfect graphs
Improper sum-list colouring of 2-trees
Eternal domination and clique covering
Polynomial Kernel for Interval Vertex Deletion
Some remarks on Hajós' conjecture
The $(k, \ell)$ partitioned probe problem: NP-complete versus polynomial dichotomy
Submodular functions and rooted trees
On a geometric property of perfect graphs
Perfect graphs with no $P_ 5$ and no $K_ 5$
On the linear extension complexity of stable set polytopes for perfect graphs
Building counterexamples
Minimum weighted clique cover on claw‐free perfect graphs
Not complementary connected and not CIS $d$-graphs form weakly monotone families
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Square-Free Graphs with No Six-Vertex Induced Path
On transversals in minimal imperfect graphs
Perfect graphs with unique $P_ 4$-structure
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
Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
On graphs with no induced five‐vertex path or paraglider
Computing clique and chromatic number of circular-perfect graphs in polynomial time
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Uniquely colorable perfect graphs
Miscellaneous digraph classes
Minimal imperfect graphs: A simple approach
The strong perfect graph conjecture for toroidal graphs
Problems close to my heart
On the interval chromatic number of proper interval graphs
On kernel-less clique-acyclic orientations of minimally imperfect graphs
Precoloring Extension III: Classes of Perfect Graphs
Antitwins in partitionable graphs
On perfect graphs and polyhedra with (0, 1)-valued extreme points
On essential components and critical sets of a graph
The clique problem with multiple-choice constraints under a cycle-free dependency graph
Entropy of symmetric graphs
C-perfect hypergraphs
Line perfect graphs
Forced color classes, intersection graphs and the strong perfect graph conjecture
The strong perfect-graph conjecture is true for $K_{1,3}$-free graphs
On chromatic number and perfectness of fuzzy graph
Modular decomposition of graphs and the distance preserving property
Edmonds polytopes and a hierarchy of combinatorial problems
Completeness for intersection classes
About skew partitions in minimal imperfect graphs
Perfect $0,\pm 1$ matrices
Perfect commuting graphs
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Perfectness of normal products of graphs
Some sequences associated with combinatorial structures
On the stability number of the edge intersection of two graphs.
Graphical properties related to minimal imperfection
New classes of perfect graphs
Maximal cliques in $\{P_{2} \cup P_{3},C_{4}\}$-free graphs
Chordal 2-connected graphs and spanning trees
Preperfect graphs
Counterexamples to three conjectures concerning perfect graphs
On generalized perfect graphs: Bounded degree and bounded edge perfection
Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
On the independence polynomial of the corona of graphs
Problems and results on 1-cross-intersecting set pair systems
Combinatorial symbolic powers
A reduction procedure for coloring perfect $K_ 4$-free graphs
STRONG KOSZULNESS OF TORIC RINGS ASSOCIATED WITH STABLE SET POLYTOPES OF TRIVIALLY PERFECT GRAPHS
Non-regular square bipartite designs
On circular critical graphs
Optimal parallel time bounds for the maximum clique problem on intervals
Handelman's hierarchy for the maximum stable set problem
Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
Quasi-parity and perfect graphs
Opposition graphs are strict quasi-parity graphs
Generalized non-coprime graphs of groups
Locally perfect graphs
Wings and perfect graphs
Perfect graphs are kernel solvable
Point partition numbers: perfect graphs
Independent set in $k$-claw-free graphs: conditional $\chi $-boundedness and the power of LP/SDP relaxations
A new property of critical imperfect graphs and some consequences
Tolerance graphs
Combinatorial designs related to the strong perfect graph conjecture
Wide partitions, Latin tableaux, and Rota's basis conjecture
Even pairs in Berge graphs

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)