✦ LIBER ✦

Knots in Hamilton Cycles

✍ Scribed by Mansfield, Marc L.

Book ID: 126876347
Publisher: American Chemical Society
Year: 1994
Tongue: English
Weight: 376 KB
Volume: 27
Category: Article
ISSN: 0024-9297
DOI: 10.1021/ma00098a057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton cycles in prisms

✍ Tomáš Kaiser; Zdeněk Ryjáček; Daniel Král; Moshe Rosenfeld; Heinz-Jürgen Voss 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB

## Abstract The prism over a graph __G__ is the Cartesian product __G__ □ __K__~2~ of __G__ with the complete graph __K__~2~. If __G__ is hamiltonian, then __G__□__K__~2~ is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxati

Polychromatic Hamilton cycles

✍ Alan Frieze; Bruce Reed 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 303 KB

The edges of the complete graph K, are coloured so that no colour appears more than k = k(n) times, k=rn/(A In n)l, for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic.

Directed Hamilton Cycles in Digraphs and

Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs

✍ Zhang, Zan-Bo; Zhang, Xiaoyan; Wen, Xuelian 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 258 KB

Oriented hamilton cycles in digraphs

✍ Roland Häggkvist; Andrew Thomason 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## Abstract We show that a directed graph of order __n__ will contain __n__‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + __n__^‐1/6^)__n__ and __n__ is sufficiently large. © 1995 John Wiley & Sons, Inc.

Hamilton cycles in plane triangulations

✍ Bill Jackson; Xingxing Yu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract We extend Whitney's Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely, we define a decomposition of a plane triangulation __G__ into 4‐connected ‘pieces,’ and show that if each piece shares a triangle

Hamilton cycles in regular graphs

✍ Bill Jackson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## UNIVERSIW OF WATERLOO ' The research reported here has been sponsored by the Canadian Commonwealth Association.