scientific article; zbMATH DE number 861334
From MaRDI portal
Publication:4871058
Recommendations
- A sufficient condition for Hamiltonian cycles in tough graphs
- On hamiltonicity of 1-tough triangle-free graphs
- Hamiltonian cycles in 1-tough graphs
- An Ore-type condition for Hamiltonicity in tough graphs
- One sufficient condition for hamiltonian graphs
- Hamiltonian degree conditions for tough graphs
- 1-tough cocomparability graphs are hamiltonian
- scientific article; zbMATH DE number 68362
- scientific article; zbMATH DE number 4134087
- scientific article; zbMATH DE number 811601
Cited in
(20)- Toughness and edge-toughness
- Hamiltonian degree conditions for tough graphs
- An Ore-type condition for Hamiltonicity in tough graphs
- scientific article; zbMATH DE number 5936422 (Why is no real title available?)
- scientific article; zbMATH DE number 4177107 (Why is no real title available?)
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs
- scientific article; zbMATH DE number 4137803 (Why is no real title available?)
- scientific article; zbMATH DE number 19172 (Why is no real title available?)
- scientific article; zbMATH DE number 54811 (Why is no real title available?)
- A Remark on Hamiltonian Cycles
- scientific article; zbMATH DE number 1214986 (Why is no real title available?)
- scientific article; zbMATH DE number 1250664 (Why is no real title available?)
- On Path-Tough Graphs
- scientific article; zbMATH DE number 1792643 (Why is no real title available?)
- Toughness and vertex degrees
- More relations between -labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
- On hamiltonicity of 1-tough triangle-free graphs
- A large set of non-Hamiltonian graphs
- An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
- A simple proof of a theorem of Jung
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871058)
