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

DOI10.1016/J.DISC.2018.02.025MaRDI QIDQ1744746zbMATH OpenOpenAlexFDO

Authors Ying Wang, Wai Chee Shiu, Min Chen, Weifan 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

discharging methodplane graphstrong chromatic indexstrong edge-coloring

Mathematics Subject Classification ID

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

Recommendations

• Strong edge-coloring of planar graphs
• Strong edge coloring of specific planar graphs
• Strong edge-colouring of sparse planar graphs
• Strong edge-coloring of planar graphs
• List strong edge coloring of planar graphs with maximum degree 4

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• Induced matchings in cubic graphs
• Problems and results in combinatorial analysis and graph theory
• Strong chromatic index of subcubic planar multigraphs
• The strong chromatic index of a cubic graph is at most 10

Cited in

(14)

• On strong edge-coloring of graphs with maximum degree 4
• List strong edge coloring of planar graphs with maximum degree 4
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge coloring of specific planar graphs
• A note on strong edge choosability of toroidal subcubic graphs
• A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs
• From light edges to strong edge-colouring of 1-planar graphs
• On 4-edge colouring planar bridgeless graphs with large girth
• Recent progress on strong edge-coloring of graphs
• 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
• Proper edge colorings of planar graphs with rainbow \(C_4\)-s
• Semistrong edge colorings of planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744746)