Leaf number and Hamiltonian \(C_4\)-free graphs
From MaRDI portal
Publication:1693960
DOI10.1007/s13370-017-0503-yzbMath1379.05071OpenAlexW2612436277MaRDI QIDQ1693960
Publication date: 1 February 2018
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-017-0503-y
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (4)
Bounds on the leaf number in graphs of girth 4 or 5 ⋮ Connectivity, traceability and Hamiltonicity ⋮ Spanning paths and cycles in triangle-free graphs ⋮ Connected Domination
Uses Software
Cites Work
- Unnamed Item
- Spanning trees with many leaves and average distance
- Neighbourhood unions and Hamiltonian properties in graphs
- 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
- A generalization of Ore's Theorem involving neighborhood unions
- A sufficient condition for graphs with large neighborhood unions to be traceable
- Sufficient conditions for a graph to be Hamiltonian
- On spanning cycles, paths and trees
- Minimum degree, leaf number and traceability
- Note on Hamilton Circuits
- Spanning Trees with Many Leaves
- Neighborhood unions and hamilton cycles
- Hamiltonian cycles in 2‐connected claw‐free‐graphs
- Minimum Degree, Leaf Number, and Hamiltonicity
- Some Theorems on Abstract Graphs
This page was built for publication: Leaf number and Hamiltonian \(C_4\)-free graphs