✦ LIBER ✦

Some improved bounds on the number of 1-factors of n-connected graphs

✍ Scribed by Harold N. Gabow

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the 1-factors of n-connected graphs

✍ Joseph Zaks 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 664 KB

The number of 1-factors in 2k-connected

✍ Béla Bollobas 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Bounds on the connected domination numbe

✍ Desormeaux, Wyatt J.; Haynes, Teresa W.; Henning, Michael A. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Upper Bounds for the Rainbow Connection

✍ Xueliang Li; Yuefang Sun 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 462 KB

Improved bounds on the chromatic numbers

✍ Kim, Seog-Jin; Park, Boram 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Upper Bounds to the Number of Vertices i

✍ Matthias Kriesell 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 145 KB