No label defined (Q3976600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 19172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 19172 |
Statements
26 June 1992
0 references
Hamiltonian
0 references
0.8635085821151733
0 references
0.8628636002540588
0 references
[For the entire collection see Zbl 0734.00014.] A graph \(G\) is 1-tough if for any separating set of vertices \(S\) of \(G\), the number of components of \(G-S\) does not exceed \(| S|\). The main result is that if \(G\) is a 1-tough graph on \(n\geq 3\) vertices with \(\delta(G)\geq(n+\kappa-2)/3\), then \(G\) is Hamiltonian. This corresponds to a result of \textit{R. Häggkvist} [J. Comb. Theory, Ser. B 30, 118-120 (1981; Zbl 0462.05046)] that any 2-connected graph on \(n\geq 3\) vertices with \(\delta(G)\geq(n+\kappa)/3\) is Hamiltonian.
0 references
