Spanning trees with small degrees and few leaves

DOI10.1016/J.AML.2011.12.021zbMATH Open1248.05038OpenAlexW2006917085MaRDI QIDQ452956FDOQ452956

Authors: E. Rivera-Campo 

Publication date: 18 September 2012

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

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

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)

Cites Work

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

Cited In (8)

• Degree-preserving spanning trees in small-degree graphs
• A note on spanning trees with a specified degree sequence
• Spanning trees with bounded degrees and leaves
• Unrooted non-binary tree-based phylogenetic networks
• Low degree spanning trees of small weight
• Spanning Trees with Few Branch Vertices
• Maintaining spanning trees of small diameter
• Title not available (Why is that?)

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)