## Abstract C. Thomassen proposed a conjecture: Let __G__ be a __k__‐connected graph with the stability number α ≥ __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 gr
✦ LIBER ✦
A note on Thomassenʼs conjecture
✍ Scribed by Domingos Dellamonica Jr.; Vojtěch Rödl
- Book ID
- 113698886
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 150 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the Thomassen's conjecture
✍
Jianping Li
📂
Article
📅
2001
🏛
John Wiley and Sons
🌐
English
⚖ 152 KB
On a conjecture of Thomassen and Toft
✍
Kriesell, Matthias
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 183 KB
👁 2 views
This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe
An improvement on Vizingʼs conjecture
✍
Wu, Yunjian
📂
Article
📅
2013
🏛
Elsevier Science
🌐
English
⚖ 111 KB
A note on ANRʼs
✍
Piotr Niemiec
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 164 KB
A note on Fortʼs theorem
✍
Moors, Warren B.
📂
Article
📅
2013
🏛
Elsevier Science
🌐
English
⚖ 137 KB
An approach to a Ricceriʼs Conjecture
✍
F.J. García-Pacheco
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 146 KB