On strong list edge coloring of subcubic graphs

DOI10.1016/j.disc.2014.06.004zbMath1298.05138OpenAlexW2029832756MaRDI QIDQ400392

Hong Zhu, Zheng-Ke Miao

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.004

zbMATH Keywords

subcubic graphsmaximum average degreestrong edge coloringstrong list edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (7)

List star edge-coloring of subcubic graphs ⋮ Unnamed Item ⋮ Strong list-chromatic index of planar graphs with Ore-degree at most seven ⋮ List strong edge-colorings of sparse graphs ⋮ 子立方平面图的$(1,0)$-松弛强边列表染色 ⋮ Strong list-chromatic index of subcubic graphs ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• On the strong chromatic index of cubic Halin graphs
• Strong list edge coloring of subcubic graphs
• Strong edge colouring of subcubic graphs
• The strong chromatic index of complete cubic Halin graphs
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• Induced matchings in cubic graphs

This page was built for publication: On strong list edge coloring of subcubic graphs