Spanning k-tree with specified vertices

DOI10.1142/S1793830919500435zbMath1420.05035OpenAlexW2954226434WikidataQ127585612 ScholiaQ127585612MaRDI QIDQ5197548

Feifei Song, Jianjie Zhou

Publication date: 18 September 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500435

zbMATH Keywords

connectivityspanning tree\(k\)-treeindependent numberspecified vertices

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Spanning \(k\)-trees of \(n\)-connected graphs
• Closure and spanning \(k\)-trees
• On a \(k\)-tree containing specified leaves in a graph
• Spanning trees with bounded degrees
• A method in graph theory
• A note on Hamiltonian circuits

This page was built for publication: Spanning k-tree with specified vertices