On minimum degree, leaf number, traceability and Hamiltonicity in graphs

DOI10.1016/j.dam.2016.12.028zbMath1357.05073OpenAlexW2581721543MaRDI QIDQ512550

Simon Mukwembi, Phillip Mafuta

Publication date: 27 February 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.028

zbMATH Keywords

minimum degreeleaf numberspanning paths and cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items

Bounds on the leaf number in graphs of girth 4 or 5 ⋮ Connectivity, traceability and Hamiltonicity ⋮ Average distance and connected domination ⋮ Spanning paths in graphs ⋮ Spanning paths and cycles in triangle-free graphs

Cites Work

• Unnamed Item
• Spanning trees with many leaves and average distance
• Spanning trees in graphs of minimum degree 4 or 5
• Minimal spanning trees with a constraint on the number of leaves
• Sufficient conditions for a graph to be Hamiltonian
• On spanning cycles, paths and trees
• Minimum degree, leaf number and traceability
• Spanning Trees with Many Leaves
• T. P. Kirkman, Mathematician
• DEGREE DISTANCE AND MINIMUM DEGREE
• Minimum Degree, Leaf Number, and Hamiltonicity
• Some Theorems on Abstract Graphs
• Spanning trees with many leaves