Strong edge-colorings of sparse graphs with large maximum degree

DOI10.1016/j.ejc.2017.06.001zbMath1371.05076arXiv1610.05406OpenAlexW2536579569MaRDI QIDQ2408965

Ilkyoo Choi, Jae-Hoon Kim, Alexandr V. Kostochka, Andre Raspaud

Publication date: 10 October 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

strong chromatic index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (9)

Strong edge-colorings of planar graphs with small girth ⋮ Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Strong edge-coloring of 2-degenerate graphs ⋮ Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs ⋮ Unnamed Item ⋮ List star chromatic index of sparse graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• Strong chromatic index of planar graphs with large girth
• Strong edge-colouring of sparse planar graphs
• Strong edge-colorings for \(k\)-degenerate graphs
• Strong chromatic index of subcubic planar multigraphs
• 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 \(k\)-degenerate graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• The strong chromatic index ofC4-free graphs
• List strong edge coloring of some classes of graphs
• Induced matchings in cubic graphs
• Strong Chromatic Index of 2-Degenerate Graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs

This page was built for publication: Strong edge-colorings of sparse graphs with large maximum degree