Abstract
A well-known conjecture in hamiltonian graph theory states that every 2-tough graph is hamiltonian. We give some equivalent conjectures, e.g., the conjecture that every 2-tough graph is hamiltonian-connected.
| Original language | English |
|---|---|
| Pages (from-to) | 539-543 |
| Number of pages | 5 |
| Journal | Journal of graph theory |
| Volume | 18 |
| DOIs | |
| Publication status | Published - 1994 |
Fingerprint
Dive into the research topics of 'On hamiltonian properties of 2-tough graphs'. Together they form a unique fingerprint.Research output
- 12 Citations
- 1 Report
-
On hamiltonian properties of 2-tough graphs
Bauer, D., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1992, University of Twente. 7 p. (Memorandum Faculty of Mathematical Sciences; no. 1037)Research output: Book/Report › Report › Professional
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver