A characterization of perfect graphs
From MaRDI portal
Publication:2553372
Cited in
(only showing first 100 items - show all)- 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
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Perfect zero–one matrices
- Near-perfect matrices
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- A class of facet producing graphs for vertex packing polyhedra
- Graph imperfection. I
- Coloring all directed paths in a symmetric tree, with an application to optical networks
- Chromatic bounds for some classes of 2 K₂-free graphs
- Forbidden graphs for degree and neighbourhood conditions
- ?-Perfect graphs
- Properties of large 2-crossing-critical graphs
- 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
- On certain polytopes associated with graphs
- Generalized perfect graphs: Characterizations and inversion
- Perfect graphs involving semitotal and semipaired domination
- Sequential colorings and perfect graphs
- An extension of Lehman's theorem and ideal set functions
- Fractional kernels in digraphs
- Mock threshold graphs
- Zur Theorie der perfekten Graphen
- Trivially perfect graphs
- A Sum of Squares Characterization of Perfect Graphs
- A note on even pairs
- \(P_4\)-domination in minimal imperfect graphs
- On minimal imperfect graphs without induced P₅
- The linear guessing number of undirected graphs
- On classes of minimal circular-imperfect graphs
- Duality and perfection for edges in cliques
- Covering Regions with Squares
- Stable effectivity functions and perfect graphs
- Independent sets and hitting sets of bicolored rectangular families
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- Chair-free Berge graphs are perfect
- Graph models for scheduling systems with machine saturation property
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- Complexity classification of some edge modification problems
- Coloring graphs with stable cutsets
- Lehman matrices
- Chordal and perfect zero-divisor graphs of posets and applications to graphs associated with algebraic structures
- A description of claw-free perfect graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Perfect product graphs
- Sum-perfect graphs
- Finite checkability for integer rounding properties in combinatorial programming problems
- The story of perfectly orderable graphs
- Star coloring of certain graph classes
- A classification of certain graphs with minimal imperfection properties
- On stable set polyhedra for K//(1,3)free graphs
- New classes of Berge perfect graphs
- Claw-free circular-perfect graphs
- Almost integral polyhedra related to certain combinatorial optimization problems
- Vertex- and edge-minimal and locally minimal graphs
- THE CHARACTER GRAPH OF A FINITE GROUP IS PERFECT
- A survey of the algorithmic aspects of modular decomposition
- Hitting all maximum stable sets in \(P_5\)-free graphs
- Motivations and history of some of my conjectures
- A new characterization of trivially perfect graphs
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- The structure of imperfect critically strongly-imperfect graphs
- Coloring graph classes with no induced fork via perfect divisibility
- Perfect graphs, kernels, and cores of cooperative games
- On the strong perfect graph conjecture and critical 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)