Degree conditions for graphs to have spanning trees with few branch vertices and leaves

DOI10.1007/s00373-018-1998-1zbMath1407.05053OpenAlexW2907577633WikidataQ128644403 ScholiaQ128644403MaRDI QIDQ1733871

Ryota Matsubara, Haruhide Matsuda, Shun-ichi Maezawa

Publication date: 21 March 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1998-1

zbMATH Keywords

spanning treeleafbranch vertexFan-type degree condition

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items (4)

Conditions for spanning trees whose internal subtrees have few branch vertices and leaves ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with few peripheral branch vertices ⋮ Spanning trees whose reducible stems have a few branch vertices

Cites Work

• Spanning trees homeomorphic to a small tree
• Independence trees and Hamilton cycles

This page was built for publication: Degree conditions for graphs to have spanning trees with few branch vertices and leaves