Minimum degree, leaf number and traceability.
From MaRDI portal
Recommendations
Cites work
- A note on degree conditions for traceability in locally claw-free graphs
- A sufficient condition for graphs with large neighborhood unions to be traceable
- Constructing full spanning trees for cubic graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Hamiltonian cycles in 2‐connected claw‐free‐graphs
- 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
- Spanning trees with many leaves and average distance
- Sufficient conditions for a graph to be Hamiltonian
Cited in
(14)- The connectivities of leaf graphs of 2-connected graphs
- Hamiltonicity, minimum degree and leaf number
- Leaf number and Hamiltonian \(C_4\)-free graphs
- Graphs with forbidden subgraphs and leaf number
- Spanning paths in graphs
- Connectivity, traceability and Hamiltonicity
- On the minimum leaf number of cubic graphs
- On spanning cycles, paths and trees
- Leaf-critical and leaf-stable graphs
- A sufficient condition on traceable
- Minimum degree, leaf number, and hamiltonicity
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs
- Spanning paths and cycles in triangle-free graphs
- Estimating the circumference of a graph in terms of its leaf number
This page was built for publication: Minimum degree, leaf number and traceability.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864428)
