This paper answers the (non)adjacency question for the whole spectrum of Hamiltonian cycles on the Hamiltonian cycle polytope (HC-polytope), also called the symmetric traveling salesman polytope, namely from Hamiltonian cycles that differ in only two edges through Hamiltonian cycles that are edge di
β¦ LIBER β¦
On Pedigree Polytopes and Hamiltonian Cycles
β Scribed by Tim S. Arthanari
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 175 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Interchange graphs and the Hamiltonian c
β
Gerard Sierksma
π
Article
π
1998
π
Elsevier Science
π
English
β 464 KB
Hamiltonian paths on 3-polytopes
β
P.R Goodey
π
Article
π
1972
π
Elsevier Science
π
English
β 522 KB
On a class of Hamiltonian polytopes
β
Stanislav JendrolΜ; Peter MihΓ³k
π
Article
π
1988
π
Elsevier Science
π
English
β 652 KB
Hamiltonian circuits on simple 3-polytop
β
Jean W Butler
π
Article
π
1973
π
Elsevier Science
π
English
β 291 KB
Edmonds polytopes and weakly hamiltonian
β
VΓ‘clav ChvΓ‘tal
π
Article
π
1973
π
Springer-Verlag
π
English
β 409 KB
Distributing vertices on Hamiltonian cyc
β
Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Colton Magnant
π
Article
π
2011
π
John Wiley and Sons
π
English
β 195 KB
## Abstract Let __G__ be a graph of order __n__ and 3β€__t__β€__n__/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theory Ser B 81(1) (2001), 100β109] provided a sharp Ξ΄(__G__) condition such that for any set __X__ of __t__ vertices, __G__ contains a hamiltonian cycle __H__ so that the dis