• DOI:10.1016/0012-365X(72)90079-9
Corpus ID: 13455278

A note on Hamiltonian circuits

@article{Chvtal1972ANO,
  title={A note on Hamiltonian circuits},
  author={V. Chv{\'a}tal and P. Erd{\"o}s},
  journal={Discret. Math.},
  year={1972},
  volume={2},
  pages={111-113}
}

• V. Chvátal, P. Erdös
• Published 1972
• Computer Science, Mathematics
• Discret. Math.

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed

Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no Hamiltonian circuit, there is a vertex x with x ~ C . Since G is s-connected, there are s paths starting at x and terminating in C which are pairwise disjoint apart from x and share with C just their terminal vertices x l, X2, . . ., x s (see [ 11, Theorem 1) . For each i = 1, 2, . . ., s, let y i be the successor of x i in a