✦ LIBER ✦

Minimal regular 2-graphs and applications

✍ Scribed by Hongbing Fan; Guizhen Liu; Jiping Liu

Book ID: 107347362
Publisher: SP Science China Press
Year: 2006
Tongue: English
Weight: 569 KB
Volume: 49
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-004-5192-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal regular graph containing a given

Minimal regular graph containing a given graph

✍ Aditya Shastri 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Interference-Minimizing Colorings of Reg

Interference-Minimizing Colorings of Regular Graphs

✍ Fishburn, P. C.; Kim, J. H.; Lagarias, J. C.; Wright, P. E. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 389 KB

Minimal 2-matching-covered graphs

✍ Shan Zhou; Heping Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Minimal permutations and 2-regular skew

Minimal permutations and 2-regular skew tableaux

✍ William Y.C. Chen; Cindy C.Y. Gu; Kevin J. Ma 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

2-factors in random regular graphs

✍ Robalewska, Hanna D. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB 👁 3 views

In this paper the expectation and variance of the number of 2-factors in random r-regular graphs for any fixed r 2 3 is analyzed and the asymptotic distribution of this variable is determined.

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