Nonhamiltonian Graphs with Given Toughness
Combinatorics
2012-09-18 v4
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 .
Keywords
Cite
@article{arxiv.1208.5463,
title = {Nonhamiltonian Graphs with Given Toughness},
author = {Zh. G. Nikoghosyan},
journal= {arXiv preprint arXiv:1208.5463},
year = {2012}
}
Comments
11 pages, corrected and improved version