๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hamilton Cycles in 2-Connected Regular Bipartite Graphs

โœ Scribed by B. Jackson; H. Li

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
671 KB
Volume
62
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hamilton cycles in regular 3-connected g
Hamilton cycles in regular 3-connected graphs
โœ Yongjin Zhu; Hao Li ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 993 KB

We show in this paper that for k Z-63, every 3-connected, k-regular simple graph on at most yk vertices is hamiltonian.

Hamilton cycles in regular graphs
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.

Hamiltonicity of regular 2-connected gra
Hamiltonicity of regular 2-connected graphs
โœ Broersma, H. J.; van den Heuvel, J.; Jackson, B.; Veldman, H. J. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 832 KB

Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Zhu and Li showed that the upper bound 3k on n can be relaxed to q k if G is 3-connected and k 2 63. We improve both results by showing that G is hamiltonian if n 5 gk -7 and G does not belong to a res

Dominating cycles in regular 3-connected
Dominating cycles in regular 3-connected graphs
โœ Bill Jackson; Hao Li; Yongjin Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 744 KB

Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Mathematics 102 (1992) 163-176. Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k > 63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamilton