Spanning trees whose stems are spiders

DOI10.1007/S00373-015-1618-2zbMath1330.05041OpenAlexW1150523951MaRDI QIDQ897247

Zheng Yan, Mikio Kano

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1618-2

zbMATH Keywords

spiderspanning treestem

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (4)

Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with few peripheral branch vertices ⋮ Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves ⋮ Spanning trees whose reducible stems have a few branch vertices

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning spiders and light-splitting switches

This page was built for publication: Spanning trees whose stems are spiders