Strong list edge coloring of subcubic graphs
type: Item
instance of: scholarly article
title: Strong list edge coloring of subcubic graphs
zbMATH Open document ID: 1296.05075
DOI: 10.1155/2013/316501
author: Hongping Ma
author: Rong Luo
author: Zhengke Miao
author: Hong Zhu
author: Jianhua Zhang
published in: Mathematical Problems in Engineering
publication date: 2014-10-13T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6354644
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/316501
OpenAlex ID: W2091431905
Wikidata QID: Q59025955
cites work: Q3320410
cites work: Q3216671
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: On the strong chromatic index of cubic Halin graphs
cites work: The strong chromatic index of complete cubic Halin graphs
cites work: Strong edge colouring of subcubic graphs
description: scientific article; zbMATH DE number 6354644