✦ LIBER ✦

On sum edge-coloring of regular, bipartite and split graphs

✍ Scribed by Petrosyan, P.A.; Kamalian, R.R.

Book ID: 121321303
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 312 KB
Volume: 165
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.09.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Edge Coloring Bipartite Graphs

✍ Cole, Richard; Hopcroft, John 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 825 KB

On -coloring split, chordal bipartite, a

On -coloring split, chordal bipartite, and weakly chordal graphs

✍ Márcia R. Cerioli; Daniel F.D. Posner 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 353 KB

On the number of edge-colourings of regu

On the number of edge-colourings of regular bipartite graphs

✍ A. Schrijver 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 562 KB

On sum coloring and sum multi-coloring f

On sum coloring and sum multi-coloring for restricted families of graphs

✍ Allan Borodin; Ioana Ivan; Yuli Ye; Bryce Zimny 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 982 KB

Multirate Rearrangeable Clos Networks an

Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs

✍ Ngo, Hung Q.; Vu, Van H. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 334 KB

Almost regular edge colorings and regula

Almost regular edge colorings and regular decompositions of complete graphs

✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge