List strong edge coloring of planar graphs with maximum degree 4

DOI10.1016/j.disc.2018.10.034zbMath1407.05065OpenAlexW2915216917WikidataQ128363332 ScholiaQ128363332MaRDI QIDQ1732781

Jie Hu, Shan Zhou, Ming Chen, Xiaowei Yu

Publication date: 25 March 2019

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

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

zbMATH Keywords

planar graphHall's theoremstrong choice number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, Strong list-chromatic index of planar graphs with Ore-degree at most seven, List strong edge-colorings of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong chromatic index of graphs with maximum degree four
• Planar graphs with maximum degree 4 are strongly 19-edge-colorable
• Strong list-chromatic index of subcubic graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Induced matchings in cubic graphs