✦ LIBER ✦

Edge-colouring random graphs

✍ Scribed by A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 653 KB
Volume: 45
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90065-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

NP-completeness of edge-colouring some r

NP-completeness of edge-colouring some restricted graphs

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

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

Colour-critical graphs with few edges

✍ A.V. Kostochka; M. Stiebitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 569 KB