✦ LIBER ✦

Edge coloring regular graphs of high degree

✍ Scribed by L Perkovic; B Reed

Book ID: 108316080
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 738 KB
Volume: 165-166
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00202-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-coloring critical graphs with high

Edge-coloring critical graphs with high degree

✍ Lian-ying Miao; Jian-liang Wu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 72 KB

Regular graphs with high edge degree

✍ Alan P Sprague 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Acyclic edge coloring of graphs with max

Acyclic edge coloring of graphs with maximum degree 4

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conj

On sum edge-coloring of regular, biparti

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

✍ Petrosyan, P.A.; Kamalian, R.R. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Edge Coloring by Total Labelings of 4-re

Edge Coloring by Total Labelings of 4-regular Circulant Graphs

✍ Seba, Hamida; Khennoufa, Riadh 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Edge-face coloring of plane graphs with

Edge-face coloring of plane graphs with maximum degree nine

✍ Jean-Sébastien Sereni; Matěj Stehlík 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3): [21][22][23][24][25][26][27][28][29][30][31][32][33] 1994] proved that every plane graph of max