✦ LIBER ✦

On the Problem of Decomposing a Graph into n Connected Factors

✍ Scribed by Tutte, W. T.

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

Impossibility of Decomposing the Complet

✍ De Caen, D.; Hoffman, D. G. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 390 KB

Efficiently parallelizable problems on a

✍ Sun-Yuan Hsieh 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 289 KB

On the complexity of partitioning a grap

✍ Bensmail, Julien 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 325 KB

Reconstructing the n-connected component

✍ D. L. Greenwell; R. L. Hemminger 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 158 KB

An extremal problem on the connectivity

✍ Qi-Mei He 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB