Planar graphs with maximum degree 4 are strongly 19-edge-colorable

DOI10.1016/j.disc.2018.02.025zbMath1384.05074OpenAlexW2789548993MaRDI QIDQ1744746

Min Chen, Wai Chee Shiu, Ying Wang, Wei Fan Wang

Publication date: 19 April 2018

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

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

zbMATH Keywords

plane graphstrong chromatic indexdischarging methodstrong edge-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (7)

Unnamed Item ⋮ Strong list-chromatic index of planar graphs with Ore-degree at most seven ⋮ The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ A note on strong edge-coloring of claw-free cubic graphs ⋮ 子立方平面图的$(1,0)$-松弛强边列表染色 ⋮ List strong edge coloring of planar graphs with maximum degree 4 ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of subcubic planar multigraphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings in cubic graphs

This page was built for publication: Planar graphs with maximum degree 4 are strongly 19-edge-colorable