Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs

DOI10.1007/S10255-006-6185-0zbMath1213.05197OpenAlexW1982773847WikidataQ123197345 ScholiaQ123197345MaRDI QIDQ993683

Jing Sun, Zhi-quan Hu

Publication date: 20 September 2010

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-6185-0

zbMATH Keywords

planar graphmaximal stable setmaximal clique

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ Vertex-transitive CIS graphs ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems

Cites Work

• Unnamed Item
• Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• Transitiv orientierbare Graphen
• Maximal chains and antichains
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs