Strong list edge coloring of subcubic graphs (Q460435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strong list edge coloring of subcubic graphs |
scientific article; zbMATH DE number 6354644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong list edge coloring of subcubic graphs |
scientific article; zbMATH DE number 6354644 |
Statements
Strong list edge coloring of subcubic graphs (English)
0 references
13 October 2014
0 references
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.
0 references
0.9810189008712769
0 references
0.914818286895752
0 references
0.903110921382904
0 references
0.8940465450286865
0 references
0.880821943283081
0 references
