Even pairs and prism corners in square-free Berge graphs

DOI10.1016/j.jctb.2018.01.003zbMath1387.05102OpenAlexW2789984778MaRDI QIDQ1748264

Frédéric Maffray, Maria Chudnovsky, Sophie Spirkl, P. D. Seymour

Publication date: 9 May 2018

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.2018.01.003

zbMATH Keywords

square-freeperfect graphsBerge graphsprismseven pairs

Mathematics Subject Classification ID

Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Finding a shortest even hole in polynomial time

Cites Work

• Unnamed Item
• The strong perfect graph theorem
• Even and odd pairs in linegraphs of bipartite graphs
• About skew partitions in minimal imperfect graphs
• Algorithms for Perfectly Contractile Graphs

This page was built for publication: Even pairs and prism corners in square-free Berge graphs