Long paths and cycles in tough graphs
From MaRDI portal
Publication:2366213
DOI10.1007/BF01195323zbMath0778.05047OpenAlexW1981157645MaRDI QIDQ2366213
Henk Jan Veldman, Jan van den Heuvel, Heinz A. Jung, Hajo J. Broersma
Publication date: 29 June 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01195323
Related Items (4)
Claw-free graphs---a survey ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Toughness in graphs -- a survey
Cites Work
- Unnamed Item
- Unnamed Item
- On a connection between the existence of k-trees and the toughness of a graph
- Relative lengths of paths and cycles in 3-connected graphs
- Relative lengths of paths and cycles in k-connected graphs
- Tough graphs and Hamiltonian circuits.
- Hamiltonian results inK1,3-free graphs
- Toughness and the existence ofk-factors
- Some Theorems on Abstract Graphs
This page was built for publication: Long paths and cycles in tough graphs
