Counterexamples to three conjectures concerning perfect graphs
From MaRDI portal
Publication:686172
DOI10.1016/0012-365X(93)90338-TzbMATH Open0795.05059WikidataQ123252948 ScholiaQ123252948MaRDI QIDQ686172FDOQ686172
Authors: Stefan Hougardy 
Publication date: 11 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Some conjectures on perfect graphs
- On the perfect graph conjecture
- Two conjectures equivalent to the perfect graph conjecture
- Counterexamples to a conjecture on matching Kneser graphs
- A graph counterexample to Davies' conjecture
- scientific article; zbMATH DE number 3902680
- Proof of a conjecture on irredundance perfect graphs
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- scientific article; zbMATH DE number 3887731
- Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
Cites Work
- A characterization of perfect graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- A semi-strong perfect graph theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Star-cutsets and perfect graphs
- A fast algorithm for coloring Meyniel graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- A new property of critical imperfect graphs and some consequences
- Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
- Alternating orientation and alternating colouration of perfect graphs
- Perfectly orderable graphs are quasi-parity graphs: a short proof
- Title not available (Why is that?)
Cited In (23)
- On the complexity of finding even pairs in planar perfect graphs
- A disproof of Henning's conjecture on irredundance perfect graphs
- Title not available (Why is that?)
- A new conjecture about minimal imperfect graphs
- Three-colourable perfect graphs without even pairs
- Title not available (Why is that?)
- Path parity and perfection
- Quasi-parity and perfect graphs
- Elementary bipartite graphs and unique colourability
- A recognition algorithm for simple-triangle graphs
- The strong perfect graph theorem
- Even pairs in Berge graphs
- Even pairs and prism corners in square-free Berge graphs
- Title not available (Why is that?)
- Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
- Title not available (Why is that?)
- On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
- Decomposing Berge graphs containing no proper wheel, long prism or their complements
- Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A structural property of monsters
- Building counterexamples
- Some conjectures on perfect graphs
This page was built for publication: Counterexamples to three conjectures concerning perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686172)
