| Proof of Ding’s conjecture on maximal stable sets and maximal cliques in planar graphs |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China （No. 10671081） and by self determined research funds of CCNU09Y01005 and CCNU09Y01018 from the colleges＇ basic research and operation of MOE. |
| |
| 摘 要： | X. Deng et al. proved Chvātal＇s conjecture on maximal stable sets and maximal cliques in graphs. G. Ding made a conjecture to generalize Chvátal＇s conjecture. The purpose of this paper is to prove this conjecture in planar graphs and the complement of planar graphs.
|
| 关 键 词： | 稳定集 极大平面图 猜想 证明 平面图形 邓小平 河谷 |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
