Código QR (código de barras bidimensional)

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...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Principais autores: Furuya Michitaka, Maezawa Shun-ichi, Matsubara Ryota, Matsuda Haruhide, Tsuchiya Shoichi, Yashima Takamasa
Format: Artigo
Sprog:Inglês
Udgivet: University of Zielona Góra 2022-02-01
Serier:Discussiones Mathematicae Graph Theory
Fag:
Online adgang:https://doi.org/10.7151/dmgt.2234
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!