Two conjectures equivalent to the perfect graph conjecture

DOI10.1016/S0012-365X(02)00403-XMaRDI QIDQ1850071zbMATH OpenWikidataFDO

Authors Baogang Xu

Publication date 2 December 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(02)00403-X

zbMATH Keywords

circular clique number

Mathematics Subject Classification ID

Perfect graphs (05C17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 3885936
• scientific article; zbMATH DE number 3910416
• On circular critical graphs
• On the strong perfect graph conjecture
• scientific article; zbMATH DE number 3887731

Cited in

(5)

• On perfectly two-edge connected graphs
• Even pairs and the strong perfect graph conjecture
• scientific article; zbMATH DE number 3885936 (Why is no real title available?)
• Counterexamples to three conjectures concerning perfect graphs
• On circular critical graphs

This page was built for publication: Two conjectures equivalent to the perfect graph conjecture

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