Hamiltonicity, minimum degree and leaf number
From MaRDI portal
Publication:1677599
DOI10.1007/S10474-017-0716-4zbMATH Open1389.05094OpenAlexW2607274492MaRDI QIDQ1677599FDOQ1677599
Authors: Tomáš Vetrík, Phillip Mafuta, Simon Mukwembi, S. Munyira 
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
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Spanning trees in graphs of minimum degree 4 or 5
- Spanning Trees with Many Leaves
- Some Theorems on Abstract Graphs
- Title not available (Why is that?)
- Hamiltonian Kneser graphs
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- On spanning cycles, paths and trees
- Minimal spanning trees with a constraint on the number of leaves
- Minimum degree, leaf number and traceability.
- Minimum degree, leaf number, and hamiltonicity
- Hamiltonian cycles in regular graphs of moderate degree
- Leaf-critical and leaf-stable graphs
Cited In (14)
- Title not available (Why is that?)
- A note on connected domination number and leaf number
- Minimum degree, leaf number, and hamiltonicity
- Minimum degree, leaf number and traceability.
- On spanning cycles, paths and trees
- Edge-connectivity and edge-disjoint spanning trees
- Connectivity, traceability and Hamiltonicity
- Average distance and connected domination
- Bounds on the leaf number in graphs of girth 4 or 5
- Leaf-critical and leaf-stable graphs
- Spanning paths and cycles in triangle-free graphs
- Radius, leaf number, connected domination number and minimum degree
- Leaf number and Hamiltonian \(C_4\)-free graphs
- Connected domination
This page was built for publication: Hamiltonicity, minimum degree and leaf number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677599)
