Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G. Since a spanning 2-tree is a Hamiltonian path, a spanning k-tree is an extended concept of a Hamiltonian path. The first result, implying the e...
Збережено в:
| Автори: | , , , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
University of Zielona Góra
2022-02-01
|
| Серія: | Discussiones Mathematicae Graph Theory |
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.7151/dmgt.2234 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|