DOIAbstract
We now know that not every 2-tough graph is hamiltonian. In fact for every ϵ > 0, there exists a (9/4−ϵ)-tough nontraceable graph. We continue our quadrennial survey of results that relate the toughness of a graph to its cycle structure
We now know that not every 2-tough graph is hamiltonian. In fact for every ϵ > 0, there exists a (9/4−ϵ)-tough nontraceable graph. We continue our quadrennial survey of results that relate the toughness of a graph to its cycle structure
AbstractWe consider toughness conditions that guarantee the existence of a hamiltonian cycle in k-tr...
this paper only finite, undirected and simple graphs are considered. In 1973 Chv'atal [4] intro...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
We now know that not every $2$-tough graph is hamiltonian. In fact for every $\epsilon > 0$, there e...
AbstractWe present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
AbstractRelated to Chvátal's famous conjecture stating that every 2-tough graph is hamiltonian, we s...
The toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A...
A graph G is called hamiltonian-connected if for every pair of distinct vertices {u, v} of G there e...
AbstractWe present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular...
AbstractWe prove the following theorem: Let G be a graph with degree sequence d1, d2,…,dn and let t ...
AbstractWe consider toughness conditions that guarantee the existence of a hamiltonian cycle in k-tr...
this paper only finite, undirected and simple graphs are considered. In 1973 Chv'atal [4] intro...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
We now know that not every $2$-tough graph is hamiltonian. In fact for every $\epsilon > 0$, there e...
AbstractWe present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
We present (9/4-ε)-tough graphs without a Hamilton path for arbitrary >0, thereby refuting a well-kn...
AbstractRelated to Chvátal's famous conjecture stating that every 2-tough graph is hamiltonian, we s...
The toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A...
A graph G is called hamiltonian-connected if for every pair of distinct vertices {u, v} of G there e...
AbstractWe present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular...
AbstractWe prove the following theorem: Let G be a graph with degree sequence d1, d2,…,dn and let t ...
AbstractWe consider toughness conditions that guarantee the existence of a hamiltonian cycle in k-tr...
this paper only finite, undirected and simple graphs are considered. In 1973 Chv'atal [4] intro...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
Add to ORKG