On the perfect graph conjecture
From MaRDI portal
Publication:1248633
DOI10.1016/S0012-365X(76)80008-8zbMATH Open0383.05018OpenAlexW1968161962WikidataQ56430112 ScholiaQ56430112MaRDI QIDQ1248633FDOQ1248633
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(76)80008-8
Cites Work
Cited In (51)
- Graphical properties related to minimal imperfection
- New classes of perfect graphs
- Counterexamples to three conjectures concerning perfect graphs
- A disproof of Henning's conjecture on irredundance perfect graphs
- On domination elimination orderings and domination graphs
- On perfectness of sums of graphs
- The maximum clique problem
- Note on the perfect EIC-graphs
- HOLES AND DOMINOES IN MEYNIEL GRAPHS
- Recognizing max-flow min-cut path matrices
- Locally perfect graphs
- A class of perfect graphs containing \(P_{6}\)
- On slim graphs, even pairs, and star-cutsets
- Coloring vertices of a graph or finding a Meyniel obstruction
- Title not available (Why is that?)
- Detecting strong cliques
- A new property of critical imperfect graphs and some consequences
- Strong cliques in vertex‐transitive graphs
- On perfectly two-edge connected graphs
- Structure and algorithms for (cap, even hole)-free graphs
- Forbidden graphs for degree and neighbourhood conditions
- On kernels in i-triangulated graphs
- On a conjecture of Meyniel
- A fast algorithm for coloring Meyniel graphs
- Skeletal graphs - a new class of perfect graphs
- On minimal imperfect graphs without induced \(P_5\)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- Meyniel weakly triangulated graphs. I: Co-perfect orderability
- Coloring Artemis graphs
- Title not available (Why is that?)
- Covering, Packing and Generalized Perfection
- Motivations and history of some of my conjectures
- A notion of cross-perfect bipartite graphs
- Title not available (Why is that?)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac
- Ramsey-type theorems
- Classes of perfect graphs
- Graphs vertex-partitionable into strong cliques
- On \(m\)-centers in \(P_ t\)-free graphs
- Square-free perfect graphs.
- Compositions for perfect graphs
- On the linear extension complexity of stable set polytopes for perfect graphs
- Slender graphs
- Star-cutsets and perfect graphs
- Slim graphs
- Some properties of minimal imperfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On essential components and critical sets of a graph
- Alternating orientation and alternating colouration of perfect graphs
- Meyniel graphs are strongly perfect
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)
