Lower bounds on the leaf number in graphs with forbidden subgraphs

DOI10.2989/16073606.2017.1282892zbMath1423.05046OpenAlexW2593851024MaRDI QIDQ5236058

Bernardo Gabriel Rodrigues, Simon Mukwembi, Phillip Mafuta, Sheunesu Munyira

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1282892

zbMATH Keywords

orderminimum degreetriangle-free graphsleaf number

Mathematics Subject Classification ID

Trees (05C05)

Related Items (6)

Bounds on the leaf number in graphs of girth 4 or 5 ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Average distance and connected domination ⋮ Graphs with forbidden subgraphs and leaf number ⋮ Connected Domination ⋮ A note on connected domination number and leaf number

Cites Work

• Unnamed Item
• Spanning trees with many leaves and average distance
• Constructing full spanning trees for cubic graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Transversal numbers of uniform hypergraphs
• Spanning trees with many leaves in cubic graphs
• Spanning Trees with Many Leaves
• Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
• Spanning trees with many leaves

This page was built for publication: Lower bounds on the leaf number in graphs with forbidden subgraphs