Strong edge-coloring for planar graphs with large girth

DOI10.1016/j.disc.2018.10.019zbMath1400.05081OpenAlexW2899654838WikidataQ128992246 ScholiaQ128992246MaRDI QIDQ1625788

Xiangqian Zhou, Gexin Yu, Kecai Deng, Lily Chen

Publication date: 29 November 2018

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

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

zbMATH Keywords

girthplanar graphstrong edge-coloring

Mathematics Subject Classification ID

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

Related Items (2)

Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Strong chromatic index of planar graphs with large girth
• Strong edge-colouring of sparse planar graphs
• Strong chromatic index of subcubic planar multigraphs
• On the precise value of the strong chromatic index of a planar graph with a large girth
• List strong edge coloring of some classes of graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• Strong edge-coloring of planar graphs

This page was built for publication: Strong edge-coloring for planar graphs with large girth