Spanning trees whose stems are spiders

DOI10.1007/S00373-015-1618-2MaRDI QIDQ897247zbMATH OpenOpenAlexFDO

Authors Mikio Kano, Zheng Yan

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) Vertex degrees (05C07) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Recommendations

• 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

Cites work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning spiders and light-splitting switches
• 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

Cited in

(10)

• Spanning trees whose stems have at most \(k\) leaves.
• Spanning trees with few peripheral branch vertices
• Spanning spiders and light-splitting switches
• Spanning trees with few peripheral branch vertices in a connected claw-free graph
• Edge tree spanners
• Spanning trees whose stems are caterpillars
• Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
• A spanning \(k\)-spider in a graph.
• Spanning trees whose reducible stems have a few branch vertices.
• scientific article; zbMATH DE number 2038756 (Why is no real title available?)

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)