Strong edge-coloring of planar graphs

DOI10.7151/dmgt.1951zbMath1372.05083OpenAlexW2582862305MaRDI QIDQ5920134

Wen Yao Song, Lian-Ying Miao

Publication date: 13 October 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1951

zbMATH Keywords

planar graphstrong chromatic indexdischarging methodstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A stronger bound for the strong chromatic index (extended abstract)
• Strong edge-colouring of sparse planar graphs
• 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
• Strong edge-coloring of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong edge-coloring of planar graphs