✦ LIBER ✦

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five

✍ Scribed by Hervé Hocquard; Mickaël Montassier

Book ID: 119236595
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 237 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.09.074

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adjacent vertex distinguishing edge-colo

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 406 KB

On the adjacent vertex-distinguishing ac

On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

✍ Wai Chee Shiu; Wai Hong Chan; Zhong-fu Zhang; Liang Bian 📂 Article 📅 2011 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 196 KB

Adjacent vertex-distinguishing edge colo

Adjacent vertex-distinguishing edge colorings of -minor free graphs

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Vertex-Distinguishing Edge Colorings of

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

✍ Bin Liu; Guizhen Liu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 183 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

Total coloring of embedded graphs of max

Total coloring of embedded graphs of maximum degree at least ten

✍ JianFeng Hou; JianLiang Wu; GuiZhen Liu; Bin Liu 📂 Article 📅 2010 🏛 SP Science China Press 🌐 English ⚖ 204 KB