✦ LIBER ✦

On edge-colouring indifference graphs

✍ Scribed by Celina M.H. de Figueiredo; João Meidanis; Célia Picinin de Mello

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 1020 KB
Volume: 181
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00264-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizing and edge-colouring split-

Characterizing and edge-colouring split-indifference graphs

✍ Z. Carmen Ortiz; Nelson Maculan; Jayme L. Szwarcfiter 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 540 KB

We describe a simple characterization of graphs which are simultaneouly split and mdiffcrcncc graphs. In the sequel, WE present a method for optimally edge colouring a complete graph M ith an c\en number > 6 of vertices, leading to a simple construction for exhibiting a perfect matching of it. in wh

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

Recent progress on edge-colouring graphs

✍ A.J.W Hilton 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 315 KB

In this note we summarize some of the progress made recently by the author, A.G. Chetwynd and P.D. Johnson about edge-eolourings of graphs with relatively large maximum degree. In this note, multigraphs will have no loops. For a multigraph G, the least number of colours needed to colour the edges o

Edge-colouring random graphs

✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 653 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

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