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

DOI10.1007/S10255-019-0864-0MaRDI QIDQ2300534zbMATH OpenOpenAlexFDO

Authors Feifei Song, Zhiquan 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

\((s + 1)\)-connected graphs\(k\)-treedegree sum conditionspanning treespecified vertices

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(8)

• Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• On a spanning tree with specified leaves
• Spanning \(k\)-trees of bipartite graphs
• Spanning k-tree with specified vertices
• A \(k\)-tree containing specified vertices
• A forbidden pair for connected graphs to have spanning k‐trees
• On a k-tree containing specified leaves in a graph

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)