登入選單

返回Google圖書搜尋

On the Thomassen's Conjecture

Jianping Li

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

註釋

Abstract: "C. Thomassen proposed a conjecture: Let G be a k-connected graph with the stability number [alpha] [> or =] k, then G has a cycle C containing k independent vertices and all their neighbors. In this paper, we will obtain the following result: Let G be a k-connected graph with stability number [alpha] = k + 3 and C any longest cycle of G, then C contains k independent vertices and all their neighbors. This solves Thomassen's conjecture for the case [alpha] = k + 3."