Spanning trees with small degrees and few leaves

DOI10.1016/J.AML.2011.12.021MaRDI QIDQ452956zbMATHOpenAlexFDO

Authors E. Rivera-Campo

Publication date 18 September 2012

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.0757

zbMATH Keywords

spanning treebounded degreefew leaves

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Abstract: We give an Ore-type condition sufficient for a graph G to have a spanning tree with small degrees and with few leaves.

Cites work

• Independence trees and Hamilton cycles
• Note on Hamilton Circuits
• On a spanning tree with specified leaves
• Spanning trees with few leaves
• Spanning trees: A survey

Cited in

(8)

• Spanning trees with bounded degrees and leaves
• Low degree spanning trees of small weight
• Spanning Trees with Few Branch Vertices
• Degree-preserving spanning trees in small-degree graphs
• Unrooted non-binary tree-based phylogenetic networks
• A note on spanning trees with a specified degree sequence
• scientific article; zbMATH DE number 6424518 (Why is no real title available?)
• Maintaining spanning trees of small diameter

This page was built for publication: Spanning trees with small degrees and few leaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452956)