Nonhamiltonian Graphs with Given Toughness
Zh. G. Nikoghosyan

TL;DR
This paper proves that for any rational toughness value between 0 and 9/4, there exists a nonhamiltonian graph with that toughness, extending previous results to a continuous range.
Contribution
It constructs nonhamiltonian graphs with any rational toughness value in the interval (0, 9/4), filling a gap in the understanding of graph toughness and Hamiltonicity.
Findings
Existence of nonhamiltonian graphs for all rational toughness in (0, 9/4)
Extension of previous toughness bounds for nonhamiltonian graphs
Provides a complete characterization of possible toughness values below 9/4
Abstract
In 1973, Chv\'{a}tal introduced the concept of toughness of a graph and constructed an infinite class of nonhamiltonian graphs with . Later Thomassen found nonhamiltonian graphs with , and Enomoto et al. constructed nonhamiltonian graphs with for each positive . The last result in this direction is due to Bauer, Broersma and Veldman, which states that for each positive , there exists a nonhamiltonian graph with . In this paper we prove that for each rational number with , there exists a nonhamiltonian graph with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · graph theory and CDMA systems
