✦ LIBER ✦

Edge-colouring of joins of regular graphs II

✍ Scribed by Caterina De Simone, Anna Galluccio

Book ID: 118802002
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 474 KB
Volume: 25
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-011-9420-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-colouring of joins of regular graph

Edge-colouring of joins of regular graphs, I

✍ Caterina De Simone; Anna Galluccio 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 403 KB

Edge colouring line graphs of unicyclic

Edge colouring line graphs of unicyclic graphs

✍ Leizhen Cai; John A. Ellis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Acyclic 4-edge colouring of non-regular

Acyclic 4-edge colouring of non-regular subcubic graphs in linear time

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

Enumerating the edge-colourings and tota

Enumerating the edge-colourings and total colourings of a regular graph

✍ S. Bessy, F. Havet 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 461 KB

Acyclic edge colouring of plane graphs

✍ Anna Fiedorowicz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Fast parallel edge colouring of graphs

✍ G. Sajith; S. Saxena 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

The following EREW PRAM algorithms for edge-colouring a general graph are presented: 1. an algorithm that finds a ðD þ dÞ-edge-colouring, 1pdoD; in Oððlog d þ ðD=dÞ 4 Þ log 2 nÞ time, using n þ m processors; 2. an algorithm that finds a D 1þe -edge-colouring, 0oeo1; in Oðlog D log Ã nÞ time, using