A characterization of perfect graphs
From MaRDI portal
Publication:2553372
Cited in
(only showing first 100 items - show all)- Even pairs in Berge graphs
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- Lehman matrices
- Vertex- and edge-minimal and locally minimal graphs
- Brambles and independent packings in chordal graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- On a geometric property of perfect graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Some sequences associated with combinatorial structures
- New classes of perfect graphs
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- A new property of critical imperfect graphs and some consequences
- Locally perfect graphs
- Wings and perfect graphs
- Opposition graphs are strict quasi-parity graphs
- Forbidden graphs for degree and neighbourhood conditions
- Perfect graphs are kernel solvable
- Graphical properties related to minimal imperfection
- Zur Theorie der perfekten Graphen
- The strong perfect graph conjecture for toroidal graphs
- A classification of certain graphs with minimal imperfection properties
- On the strong perfect graph conjecture and critical graphs
- On stable set polyhedra for K//(1,3)free graphs
- Coloring graphs with stable cutsets
- Short-chorded and perfect graphs
- Perfect graph decompositions
- Perfect graphs and norms
- Optimal parallel time bounds for the maximum clique problem on intervals
- Antitwins in partitionable graphs
- 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
- Perfect product graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- Trivially perfect graphs
- Perfectness of normal products of graphs
- Combinatorial designs related to the strong perfect graph conjecture
- On minimal imperfect graphs without induced P₅
- Sequential colorings and perfect graphs
- \(P_4\)-domination in minimal imperfect graphs
- A description of claw-free perfect graphs
- Near-perfect matrices
- New classes of Berge perfect graphs
- A note on clutter partitions
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Quasi-parity and perfect graphs
- Motivations and history of some of my conjectures
- On transversals in minimal imperfect graphs
- Perfect graphs with unique \(P_ 4\)-structure
- Building counterexamples
- Fractional kernels in digraphs
- Chair-free Berge graphs are perfect
- On a conjecture about uniquely colorable perfect graphs
- On essential components and critical sets of a graph
- On certain polytopes associated with graphs
- Wide partitions, Latin tableaux, and Rota's basis conjecture
- Completeness for intersection classes
- Non-regular square bipartite designs
- Mock threshold graphs
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- Star coloring of certain graph classes
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Sum-perfect graphs
- Chromatic bounds for some classes of 2 K₂-free graphs
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- Uniquely colorable perfect graphs
- Graph imperfection. I
- About skew partitions in minimal imperfect graphs
- On the stability number of the edge intersection of two graphs.
- On the Laplacian spectrum of (\(\alpha,\omega\))-graphs
- Finite-type invariants for graphs and graph reconstructions
- Generalized perfect graphs: Characterizations and inversion
- The structure of imperfect critically strongly-imperfect graphs
- Minimal imperfect graphs: A simple approach
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Stable effectivity functions and perfect graphs
- Forced color classes, intersection graphs and the strong perfect graph conjecture
- Independent sets and hitting sets of bicolored rectangular families
- Submodular functions and rooted trees
- Point partition numbers: perfect graphs
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Coloring graph classes with no induced fork via perfect divisibility
- Structural properties of Toeplitz graphs
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- On circular-perfect graphs: a survey
- Maximal ambiguously \(k\)-colorable graphs
- On the linear extension complexity of stable set polytopes for perfect graphs
- Modular decomposition of graphs and the distance preserving property
- Improper sum-list colouring of 2-trees
- On the interval chromatic number of proper interval graphs
- The story of perfectly orderable graphs
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- Perfect graphs, kernels, and cores of cooperative games
- The linear guessing number of undirected graphs
- The maximum vertex coverage problem on bipartite graphs
- Combinatorial symbolic powers
- On classes of minimal circular-imperfect graphs
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
- Edmonds polytopes and a hierarchy of combinatorial problems
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)
