Three-colourable perfect graphs without even pairs

DOI10.1016/J.JCTB.2011.11.005zbMATH Open1236.05090OpenAlexW2145520578MaRDI QIDQ412165FDOQ412165

Authors: Maria Chudnovsky, Paul Seymour 

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.11.005

Recommendations

• Counterexamples to three conjectures concerning perfect graphs
• Progress on perfect graphs
• A note on perfect graphs
• Even pairs and the strong perfect graph conjecture
• scientific article; zbMATH DE number 861423

zbMATH Keywords

2-joinbipartite graphsline graphsperfect graphsBerge graphswithout clique cutsetswithout even pairs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Cites Work

• The strong perfect graph theorem
• Recognizing Berge graphs
• \(K_{4}\)-free graphs with no odd holes
• About skew partitions in minimal imperfect graphs
• Even pairs in Berge graphs
• Critical perfect graphs and perfect 3-chromatic graphs
• Even pairs
• \(K_{4}\)-free graphs with no odd hole: even pairs and the circular chromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Perfect precise colourings of \(\{3,n\}\) with \(n\) colours
• Finding induced paths of given parity in claw-free graphs

This page was built for publication: Three-colourable perfect graphs without even pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412165)