On the perfect graph conjecture
From MaRDI portal
Publication:1248633
Cites work
Cited in
(51)- On the linear extension complexity of stable set polytopes for perfect graphs
- Meyniel graphs are strongly perfect
- A fast algorithm for coloring Meyniel graphs
- Motivations and history of some of my conjectures
- Note on the perfect EIC-graphs
- Skeletal graphs - a new class of perfect graphs
- scientific article; zbMATH DE number 6180527 (Why is no real title available?)
- Square-free perfect graphs.
- scientific article; zbMATH DE number 3869356 (Why is no real title available?)
- On slim graphs, even pairs, and star-cutsets
- On essential components and critical sets of a graph
- Coloring vertices of a graph or finding a Meyniel obstruction
- A notion of cross-perfect bipartite graphs
- Slender graphs
- scientific article; zbMATH DE number 6851856 (Why is no real title available?)
- Graphs vertex-partitionable into strong cliques
- scientific article; zbMATH DE number 861396 (Why is no real title available?)
- Counterexamples to three conjectures concerning perfect graphs
- Detecting strong cliques
- Forbidden graphs for degree and neighbourhood conditions
- On perfectly two-edge connected graphs
- Star-cutsets and perfect graphs
- Slim graphs
- Some properties of minimal imperfect graphs
- Coloring Artemis graphs
- Structure and algorithms for (cap, even hole)-free graphs
- A disproof of Henning's conjecture on irredundance perfect graphs
- Compositions for perfect graphs
- Meyniel weakly triangulated graphs. I: Co-perfect orderability
- Alternating orientation and alternating colouration of perfect graphs
- Graphical properties related to minimal imperfection
- On domination elimination orderings and domination graphs
- On minimal imperfect graphs without induced \(P_5\)
- A new property of critical imperfect graphs and some consequences
- Recognizing max-flow min-cut path matrices
- Locally perfect graphs
- The maximum clique problem
- On perfectness of sums of graphs
- Covering, Packing and Generalized Perfection
- Holes and dominoes in Meyniel graphs
- New classes of perfect graphs
- A class of perfect graphs containing \(P_{6}\)
- Ramsey-type theorems
- On kernels in i-triangulated graphs
- Classes of perfect graphs
- scientific article; zbMATH DE number 3887731 (Why is no real title available?)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
- On a conjecture of Meyniel
- Strong cliques in vertex‐transitive graphs
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- On \(m\)-centers in \(P_ t\)-free graphs
This page was built for publication: On the perfect graph conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248633)
