Graphs with forbidden subgraphs and leaf number

DOI10.1007/S13370-018-0605-1MaRDI QIDQ1715759zbMATH OpenOpenAlexWikidataFDO

Authors G. Nhawu, Phillip Mafuta, J. P. Mazorodze, Josiah Mushanyu

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

leaf numberminimum degreeorder

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Minimum degree, leaf number and traceability.
• Connectivity, traceability and Hamiltonicity
• Spanning trees with a bounded number of leaves in a claw-free graph.
• Radius, leaf number, connected domination number and minimum degree

Cites work

• Constructing full spanning trees for cubic graphs
• scientific article; zbMATH DE number 5079858 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 5037210 (Why is no real title available?)
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Minimal spanning trees with a constraint on the number of leaves
• Spanning trees in graphs of minimum degree 4 or 5
• Spanning Trees with Many Leaves
• Spanning trees with many leaves and average distance
• Spanning trees with many leaves in cubic graphs
• Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
• Sufficient conditions for a graph to be Hamiltonian
• Transversal numbers of uniform hypergraphs

Cited in

(5)

• Connected domination
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Radius, leaf number, connected domination number and minimum degree
• Average distance and connected domination
• On a conjecture by Griggs, Kleitman and Shastri

Describes a project that uses

Uses Software

• GRAFFITI

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

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