Classes of perfect graphs
From MaRDI portal
Publication:2433714
Recommendations
Cites work
- scientific article; zbMATH DE number 3889564 (Why is no real title available?)
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3902681 (Why is no real title available?)
- scientific article; zbMATH DE number 3904622 (Why is no real title available?)
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 108587 (Why is no real title available?)
- scientific article; zbMATH DE number 3556145 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 1445284 (Why is no real title available?)
- scientific article; zbMATH DE number 3214398 (Why is no real title available?)
- scientific article; zbMATH DE number 3322855 (Why is no real title available?)
- scientific article; zbMATH DE number 3390792 (Why is no real title available?)
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- A Linear Recognition Algorithm for Cographs
- A New Class of Brittle Graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A decomposition theorem for partially ordered sets
- A description of claw-free perfect graphs
- A fast algorithm for coloring Meyniel graphs
- A good characterization of cograph contractions
- A linear algorithm to color i-triangulated graphs
- A new property of critical imperfect graphs and some consequences
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- Algorithms for weakly triangulated graphs
- Algorithms on clique separable graphs
- All variations on perfectly orderable graphs
- Alternating orientation and alternating colouration of perfect graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An O(n^2) algorithm to color Meyniel graphs
- An algorithm for colouring perfect planar graphs
- Asteroidal Triple-Free Graphs
- Blocking and anti-blocking pairs of polyhedra
- Bull-free Berge graphs are perfect
- Chair-free Berge graphs are perfect
- Coloring perfect \((K_ 4\)-e)-free graphs
- Coloring perfect degenerate graphs
- Decomposition by clique separators
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Finding houses and holes in graphs
- Graph Classes: A Survey
- Holes and dominoes in Meyniel graphs
- How To Color Claw-Free Perfect Graphs
- Independent Sets in Asteroidal Triple-Free Graphs
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Line perfect graphs
- Locally perfect graphs
- Matching theory
- Murky graphs
- On P₄-transversals of perfect graphs
- On a property of the class of n-colorable graphs
- On brittle graphs
- On maximal independent sets of vertices in claw-free graphs
- On rigid circuit graphs
- On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs
- On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs
- On the complexity of recognizing perfectly orderable graphs
- On the extension of bipartite to parity graphs
- On the perfect graph conjecture
- On the semi-perfect elimination
- Optimizing Bull-Free Perfect Graphs
- Origins and genesis
- Partially Ordered Sets
- Paw-free graphs
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Perfectly contractile graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Precoloring Extension III: Classes of Perfect Graphs
- Preperfect graphs
- Recognizing P₄ -Sparse Graphs in Linear Time
- Recognizing Berge graphs
- Recognizing Dart-Free Perfect Graphs
- Recognizing Perfect 2-Split Graphs
- Recognizing \(i\)-triangulated graphs in \(O(mn)\) time
- Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
- Recognizing bull-free perfect graphs
- Recognizing claw-free perfect graphs
- Representation of a finite graph by a set of intervals on the real line
- Skeletal graphs - a new class of perfect graphs
- Slender graphs
- Slightly triangulated graphs are perfect
- Slim graphs
- Split-neighbourhood graphs and the strong perfect graph conjecture
- Square-free perfect graphs.
- Star-cutsets and perfect graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Strong Perfect Graph Conjecture for Planar Graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The splittance of a graph
- The strong perfect graph conjecture for toroidal graphs
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
- The strong perfect graph theorem
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The validity of the strong perfect-graph conjecture for (K₄-e)-free graphs
- Transitiv orientierbare Graphen
- Trivially perfect graphs
- Two classes of perfect graphs
- Weakly triangulated graphs
- Wing-triangulated graphs are perfect
Cited in
(27)- New classes of perfect graphs
- Multi-word-representability of graphs
- On cover-structure graphs
- The strong perfect graph theorem
- Strong cliques in diamond-free graphs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Two classes of perfect graphs
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- How the proof of the strong perfect graph conjecture was found
- -boundedness and related problems on graphs without long induced paths: a survey
- On some graph classes related to perfect graphs: a survey
- On edge perfectness and classes of bipartite graphs
- Chromatic and clique numbers of a class of perfect graphs
- Structural properties of Toeplitz graphs
- Unconditional reflexive polytopes
- Open packing number for some classes of perfect graphs
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- New characterizations of Gallai's \(i\)-triangulated graphs
- On a Class of P 5 -Free Graphs
- Cograph generation with linear delay
- Online coloring a token graph
- scientific article; zbMATH DE number 444736 (Why is no real title available?)
- Structural properties of super strongly perfect graphs
- Classes of graphs which approximate the complete Euclidean graph
- Structure of super strongly perfect graphs
This page was built for publication: Classes of perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433714)
