On a spanning \(K\)-tree containing specified vertices in a graph

DOI10.1007/S10255-019-0864-0zbMath1433.05078OpenAlexW2994628207MaRDI QIDQ2300534

Feifei Song, Zhi-quan Hu

Publication date: 27 February 2020

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-019-0864-0

zbMATH Keywords

spanning tree\(k\)-treespecified verticesdegree sum condition\((s + 1)\)-connected graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Hamilton connected graphs
• On a \(k\)-tree containing specified leaves in a graph
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)

This page was built for publication: On a spanning \(K\)-tree containing specified vertices in a graph