✦ LIBER ✦

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

✍ Scribed by Jing Sun; Zhi-quan Hu

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2010
Tongue: English
Weight: 185 KB
Volume: 26
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-006-6185-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalizations of Grillet's theorem on

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs

✍ Wenan Zang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Disjoint cliques and disjoint maximal in

Disjoint cliques and disjoint maximal independent sets of vertices in graphs

✍ Paul Erdös; Arthur M. Hobbs; C. Payan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 548 KB

Constraints on the number of maximal ind

Constraints on the number of maximal independent sets in graphs

✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m

Extending the Balas-Yu bounds on the num

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

✍ Endre Boros; Khaled Elbassioni; Vladimir Gurvich; Leonid Khachiyan 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 191 KB