On a spanning K-tree containing specified vertices in a graph

DOI10.1007/S10255-019-0864-0zbMATH Open1433.05078OpenAlexW2994628207MaRDI QIDQ2300534FDOQ2300534

Zhiquan Hu, Feifei Song

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

Recommendations

• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• Spanning \(k\)-tree with specified vertices
• On a \(k\)-tree containing specified leaves in a graph
• Spanning \(k\)-trees of \(n\)-connected graphs
• On the SPANNING \(k\)-TREE problem
• A \(k\)-tree containing specified vertices
• On tree-\(t\)-spanners in graphs
• On tree-\(t\)-spanners in graphs
• On a spanning tree with specified leaves in a bipartite graph
• Spanning \(k\)-trees of bipartite graphs

zbMATH Keywords

spanning tree\(k\)-treedegree sum conditionspecified vertices\((s + 1)\)-connected graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• On a \(k\)-tree containing specified leaves in a graph
• A forbidden pair for connected graphs to have spanning k‐trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300534)