✦ LIBER ✦

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes

✍ Scribed by Romeo Rizzi, David Cariolaro

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds and complexity results for strong

✍ Hervé Hocquard; Pascal Ochem; Petru Valicov 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Remarkable Groups of Graphs with Edge Co

✍ Ulrike Baumann; Manfred Lesch; Irmgard Schmeichel 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 689 KB

The complexity of H-colouring of bounded

✍ Anna Galluccio; Pavol Hell; Jaroslav Nešetřil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 104 KB

On Parsimonious Edge-Colouring of Graphs

✍ Fouquet, J.-L.; Vanherpe, J.-M. 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 233 KB

Parallel O(log n) time edge-colouring of

✍ Alan M. Gibbons; Amos Israeli; Wojciech Rytter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 674 KB

Acyclic 4-edge colouring of non-regular

✍ Lukot’ka, Robert 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 362 KB