Another cycle structure theorem for Hamiltonian graphs (Q1297455): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:00, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Another cycle structure theorem for Hamiltonian graphs |
scientific article |
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