Another cycle structure theorem for Hamiltonian graphs (Q1297455)
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 1321809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Another cycle structure theorem for Hamiltonian graphs |
scientific article; zbMATH DE number 1321809 |
Statements
Another cycle structure theorem for Hamiltonian graphs (English)
0 references
25 October 1999
0 references
This paper shows that for a Hamiltonian graph \(G\) of order \(n\), if non-adjacent vertices \(x\) and \(y\) of distance 2 on a Hamiltonian cycle satisfy \(d(x)+d(y)\geq n\), then \(G\) is either pancyclic or bipartite except only for the \(n-1\)-cycle and the 3-cycle \((d(x)\) is the degree of \(x\) and \(d(y)\) of \(y\)).
0 references
Hamiltonian graph
0 references
pancyclic graph
0 references
cycle
0 references
0.8937179446220398
0 references
0.8706991076469421
0 references
0.8648924827575684
0 references
0.863771378993988
0 references
0.8605749607086182
0 references
