Hamiltonicity, minimum degree and leaf number

DOI10.1007/s10474-017-0716-4zbMath1389.05094OpenAlexW2607274492MaRDI QIDQ1677599

Tomáš Vetrík, Phillip Mafuta, Sheunesu Munyira, Simon Mukwembi

Publication date: 10 November 2017

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-017-0716-4

zbMATH Keywords

minimum degreeHamiltonicitytraceabilityleaf number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (7)

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

Cites Work

• Unnamed Item
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Hamiltonian cycles in regular graphs of moderate degree
• Minimal spanning trees with a constraint on the number of leaves
• Hamiltonian Kneser graphs
• On spanning cycles, paths and trees
• Minimum degree, leaf number and traceability
• Leaf-Critical and Leaf-Stable Graphs
• Spanning Trees with Many Leaves
• Minimum Degree, Leaf Number, and Hamiltonicity
• Some Theorems on Abstract Graphs

This page was built for publication: Hamiltonicity, minimum degree and leaf number