Graphs with forbidden subgraphs and leaf number

DOI10.1007/s13370-018-0605-1zbMath1413.05051OpenAlexW2808507082WikidataQ129708681 ScholiaQ129708681MaRDI QIDQ1715759

G. Nhawu, Josiah Mushanyu, Jaya Percival Mazorodze, Phillip Mafuta

Publication date: 29 January 2019

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-018-0605-1

zbMATH Keywords

orderminimum degreeleaf number

Mathematics Subject Classification ID

Trees (05C05)

Related Items (3)

Radius, leaf number, connected domination number and minimum degree ⋮ Average distance and connected domination ⋮ Connected Domination

Uses Software

• GRAFFITI

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Minimal spanning trees with a constraint on the number of leaves
• Transversal numbers of uniform hypergraphs
• Sufficient conditions for a graph to be Hamiltonian
• Spanning trees with many leaves in cubic graphs
• Spanning Trees with Many Leaves
• Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
• Lower bounds on the leaf number in graphs with forbidden subgraphs

This page was built for publication: Graphs with forbidden subgraphs and leaf number