✦ LIBER ✦

Vertex partitions of non-complete graphs into connected monochromatic -regular graphs

✍ Scribed by Gábor N. Sárközy; Stanley M. Selkow; Fei Song

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex Partitions by Connected Monochrom

✍ Gábor N. Sárközy; Stanley M. Selkow 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 135 KB

An Improved Bound for Vertex Partitions

✍ Gábor N. Sárközy; Stanley M. Selkow; Fei Song 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

Partitioning 3-coloured complete graphs

✍ Alexey Pokrovskiy 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Partition conditions and vertex-connecti

✍ Ervin Győri 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 476 KB

Decomposition of the completer-graph int

✍ Noga Alon 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 307 KB

r-Regular, r-connected decompositions of

✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.