On some graph classes related to perfect graphs: a survey
From MaRDI portal
Publication:2184662
Recommendations
- Classes of perfect graphs
- scientific article; zbMATH DE number 3851153
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- On clique-perfect and K-perfect graphs
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 22656 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- scientific article; zbMATH DE number 3437188 (Why is no real title available?)
- scientific article; zbMATH DE number 1455118 (Why is no real title available?)
- scientific article; zbMATH DE number 863476 (Why is no real title available?)
- scientific article; zbMATH DE number 1409177 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- A decomposition theorem for partially ordered sets
- A polynomial recognition algorithm for balanced matrices
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Algorithms for finding clique-transversals of graphs
- Algorithms on circular-arc graphs
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Balanced matrices
- Berge trigraphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Characterizations of strongly chordal graphs
- Classes of perfect graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-perfectness and balancedness of some graph classes
- Clique-perfectness of claw-free planar graphs
- Clique-perfectness of complements of line graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complement reducible graphs
- Coordinated graphs and clique graphs of clique-Helly perfect graphs
- Covering the cliques of a graph with vertices
- Distance-hereditary graphs
- Distance-hereditary graphs are clique-perfect
- Exponential families of minimally non-coordinated graphs
- Graph Classes: A Survey
- How the proof of the strong perfect graph conjecture was found
- Kernels in perfect line-graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Minimal non-neighborhood-perfect graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Neighborhood perfect graphs
- Neighbourhood-perfect line graphs
- Normal hypergraphs and the perfect graph conjecture
- On balanced graphs
- On certain polytopes associated with graphs
- On clique-perfect and K-perfect graphs
- On clique-transversals and clique-independent sets
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Partial characterizations of coordinated graphs: Line graphs and complements of forests
- Perfect graphs
- Progress on perfect graphs
- Recognizing Berge graphs
- Recognizing balanceable matrices
- Recognizing claw-free perfect graphs
- Strong tree-cographs are Birkhoff graphs
- Sur le coloriage des graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- The strong perfect graph theorem
- The structure of claw-free graphs
- Topics on perfect graphs
- Transitiv orientierbare Graphen
- Triangle-free four-chromatic graphs
- Triangle-free graphs with large chromatic numbers
Cited in
(9)- Orientable burning number of graphs
- Orientable burning number of graphs
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Two classes of perfect graphs
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- On edge perfectness and classes of bipartite graphs
- Literature reviews in operations research: a new taxonomy and a meta review
- Coprime divisors graphs and their coloring parameters
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
This page was built for publication: On some graph classes related to perfect graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184662)
