登入選單

返回Google圖書搜尋

A Generalization of Chvátal-Erdös' Result in Graphs

Jianping Li

出版	Université de Paris-Sud. Centre d'Orsay. Laboratoire de Recherche en Informatique [LRI], 1998
URL	http://books.google.com.hk/books?id=zUmJHAAACAAJ&hl=&source=gbs_api

註釋

Abstract: "Chvátal and Erdös proved a result: Let G be a k-connected graph with stability number [alpha] [or =] k, then G is Hamiltonian. Häggkvist conjectured that if G is a k-connected graph with stability number [alpha](G) [ or =] k and C is one longest cycle of G, then [alpha](G-C) [