On the Independence Number of Traceable 2-Connected Claw-Free Graphs
A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable. In this article, we show that every 2-connected claw-free graph with independence numbe...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
University of Zielona Góra
2019-11-01
|
| سلاسل: | Discussiones Mathematicae Graph Theory |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://doi.org/10.7151/dmgt.2113 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|