𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge colouring line graphs of unicyclic graphs

✍ Scribed by Leizhen Cai; John A. Ellis

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
691 KB
Volume
36
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-colouring random graphs
Edge-colouring random graphs
✍ A.M Frieze; B Jackson; C.J.H McDiarmid; B Reed πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 653 KB
On edge-colouring indifference graphs
On edge-colouring indifference graphs
✍ Celina M.H. de Figueiredo; JoΓ£o Meidanis; CΓ©lia Picinin de Mello πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1020 KB
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

Recent progress on edge-colouring graphs
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