scientific article; zbMATH DE number 7352032

zbMath1465.05067MaRDI QIDQ4990127

Min Chen, Jingjing Huo, Xinhong Pang, Wei Fan Wang

Publication date: 28 May 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p284.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

strong edge-coloringstrongly 10-edge-choosable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• On strong list edge coloring of subcubic graphs
• Strong list edge coloring of subcubic graphs
• 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
• List strong edge coloring of planar graphs with maximum degree 4
• Planar graphs with maximum degree 4 are strongly 19-edge-colorable
• Strong list-chromatic index of subcubic graphs
• List strong edge-coloring of graphs with maximum degree 4
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs

This page was built for publication: