Long paths and cycles in tough graphs
From MaRDI portal
Publication:2366213
DOI10.1007/BF01195323zbMath0778.05047MaRDI QIDQ2366213
Jan van den Heuvel, Hajo J. Broersma, Heinz A. Jung, Henk Jan Veldman
Publication date: 29 June 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05C38: Paths and cycles
Related Items
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs, Claw-free graphs---a survey, 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