Colouring series-parallel graphs

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

Equistable series–parallel graphs

✍ Ephraim Korach; Uri N. Peled 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable out

A parallel algorithm for minimum weighte

A parallel algorithm for minimum weighted colouring of triangulated graphs

✍ Chính T. Hoàng 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Chromaticity of series-parallel graphs

✍ K.M. Koh; C.P. Teo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 454 KB

By applying a sequence of edge-gluings on a set of cycles each of length k, we obtain a special series-parallel graph. The well-known k-gon tree theorem (see [l, lo]) states that these graphs form a X-equivalence class. Many of the other known classes of X-unique graphs and X-equivalence classes are

Edge-colouring random graphs

✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Fractionally colouring total graphs

✍ K. Kilakos; B. Reed 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 312 KB