𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-colouring of joins of regular graphs, I

✍ Scribed by Caterina De Simone; Anna Galluccio

Publisher
Springer US
Year
2009
Tongue
English
Weight
403 KB
Volume
18
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast parallel edge colouring of 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

Decompositions for the edge colouring of
Decompositions for the edge colouring of reduced indifference graphs
✍ Celina M.H. de Figueiredo; JoΓ£o Meidanis; CΓ©lia Picinin de Mello; Carmen Ortiz πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 140 KB

The chromatic index problem-ΓΏnding the minimum number of colours required for colouring the edges of a graph-is still unsolved for indi erence graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order. We present new positi

Transformations of edge-coloured cubic g
Transformations of edge-coloured cubic graphs
✍ Yasuyuki Tsukui πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 491 KB

For a simple 3-edge-coloured cubic graph, an edge-c-reduction and three transformations (S-, X-, and H-transformation) are defined. Each transformation preserves order and regularity of graphs. They also define metrics on the set of all (connected) 3-edge-coloured cubic graphs with the same order. A