Precise upper bound for the strong edge chromatic number of sparse planar graphs

DOI10.7151/dmgt.1708zbMath1301.05118OpenAlexW2101397758MaRDI QIDQ5495056

Anna O. Ivanova, Oleg V. Borodin

Publication date: 30 July 2014

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

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

zbMATH Keywords

edge coloringplanar graph2-distance coloringstrong edge coloring

Mathematics Subject Classification ID

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

Related Items (17)

Strong edge-coloring for planar graphs with large girth ⋮ On the strong chromatic index of sparse graphs ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Strong chromatic index of graphs with maximum degree four ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of subcubic planar graphs ⋮ Strong chromatic index of planar graphs with large girth ⋮ Strong edge-colouring of sparse planar graphs ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ Odd graph and its applications to the strong edge coloring ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ Recent progress on strong edge-coloring of graphs

This page was built for publication: Precise upper bound for the strong edge chromatic number of sparse planar graphs