Long cycles in graphs with prescribed toughness and minimum degree
From MaRDI portal
Publication:1894753
DOI10.1016/0012-365X(93)E0204-HzbMath0831.05039OpenAlexW2055130189MaRDI QIDQ1894753
Douglas Bauer, Henk Jan Veldman, Hajo J. Broersma, Jan van den Heuvel
Publication date: 24 July 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0204-h
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (15)
Toughness and edge-toughness ⋮ Forbidden subgraphs for Hamiltonicity of 1-tough graphs ⋮ Minimum degree, independence number and regular factors ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs ⋮ Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy ⋮ An Ore-type condition for hamiltonicity in tough graphs and the extremal examples ⋮ Hamiltonicity in Split Graphs - A Dichotomy ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ Spanning paths in graphs ⋮ Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs ⋮ Toughness in graphs -- a survey ⋮ Implementation of RTO in a large hydrogen network considering uncertainty ⋮ An Ore-type condition for Hamiltonicity in tough graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Long cycles in graphs with large degree sums
- Existence of Dlambda-cycles and Dlambda-paths
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
- Toughness and triangle-free graphs
- A note on Hamiltonian circuits
- Tough graphs and Hamiltonian circuits.
- On Maximal Circuits in Finite Graphs
- Toughness, minimum degree, and the existence of 2‐factors
- Some Theorems on Abstract Graphs
This page was built for publication: Long cycles in graphs with prescribed toughness and minimum degree
