Strong List Edge Coloring of Subcubic Graphs

Hongping Ma, Zhengke Miao, Hong Zhu, Jianhua Zhang and Rong Luo

Mathematical Problems in Engineering, 2013, vol. 2013, 1-6

Abstract:

We study strong list edge coloring of subcubic graphs, and we prove that every subcubic graph with maximum average degree less than 15/7, 27/11, 13/5, and 36/13 can be strongly list edge colored with six, seven, eight, and nine colors, respectively.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/316501.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/316501.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:316501

DOI: 10.1155/2013/316501

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().