✦ LIBER ✦

K-Factors and Hamilton Cycles in Graphs

✍ Scribed by Zhi Guo Wang; Zhen Jiang Zhao

Book ID: 106278092
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2006
Tongue: English
Weight: 130 KB
Volume: 23
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-005-0905-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree sums,k-factors and hamilton cycle

Degree sums,k-factors and hamilton cycles in graphs

✍ R. J. Faudree; J. van den Heuvel 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 431 KB

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views

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.

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

Hamilton cycles and paths in butterfly g

Hamilton cycles and paths in butterfly graphs

✍ Stephen A. Wong 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

## Abstract A cycle __C__ in a graph __G__ is a __Hamilton cycle__ if __C__ contains every vertex of __G__. Similarly, a path __P__ in __G__ is a __Hamilton path__ if __P__ contains every vertex of __G__. We say that __G__ is __Hamilton__‐__connected__ if for any pair of vertices, __u__ and __v__ o

Hamilton cycles in Trivalent Cayley grap

Hamilton cycles in Trivalent Cayley graphs

✍ Meghanad D. Wagh; Jiancheng Mo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

It is shown that the Trivalent Cayley graphs, TC,,, are near recursive. In particular, TC, is a union of four copies of i"Cn\_2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC,.