The strong chromatic index of sparse graphs

DOI10.1016/j.ipl.2014.10.006zbMath1304.05043arXiv1301.1992OpenAlexW1997772282MaRDI QIDQ477679

Małgorzata Śleszyńska-Nowak, Jarosław Grytczuk, Michał Dębski

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.1992

zbMATH Keywords

combinatorial problemssparse graphsstrong chromatic indexstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (10)

Strong edge coloring of circle graphs ⋮ Clique number of the square of a line graph ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ A note on strong edge coloring of sparse graphs ⋮ Strong cliques in claw-free graphs ⋮ Colouring exact distance graphs of chordal graphs ⋮ Strong Chromatic Index of Sparse Graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Induced matchings in bipartite graphs
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• Strong chromatic index of \(k\)-degenerate graphs
• Nearly complete graphs decomposable into large induced matchings and their applications
• Unnamed Item
• Unnamed Item

This page was built for publication: The strong chromatic index of sparse graphs