𝔖 Bobbio Scriptorium
✦   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

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

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
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