Spanning trees whose stems are spiders
The stem of a tree \(T\) is the graph obtained from \(T\) be deleting its leaves; a spider is a tree with at most one vertex with degree greater than two. Let \(G\) be a graph; it is proved here that if the minimal degree sum of four vertices of \(G\), such that the distance between any two of them is at least four, is at least \(|G|-5\), then \(G\) has a spanning tree whose stem is a spider. A counterexample shows that this condition is optimal. As a corollary, if the minimal degree of vertices of \(|G|\) is at least \((|G|-5)/4\), then \(G\) has a spannign tree whose stem is a spider.
- Spanning trees in a cactus
- Spanning Trees with Many Leaves
- Spanning trees with many leaves
- Spanning trees with many leaves
- scientific article; zbMATH DE number 6424518
- scientific article; zbMATH DE number 1424297
- Spanning trees with few leaves
- Spanning Trees with Few Branch Vertices
- Spanning trees whose stems have a bounded number of branch vertices
- Super total gracefulness of a class of spider trees
- Spanning spiders and light-splitting switches
- Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
- Edge tree spanners
- Spanning trees with few peripheral branch vertices
- Spanning trees with few peripheral branch vertices in a connected claw-free graph
- Spanning trees whose stems have at most k leaves.
- scientific article; zbMATH DE number 2038756 (Why is no real title available?)
- A spanning k-spider in a graph.
- Spanning trees whose reducible stems have a few branch vertices.
- Spanning trees whose stems are caterpillars
This page was built for publication: Spanning trees whose stems are spiders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897247)
