Strong edge-colorings of sparse graphs with large maximum degree
From MaRDI portal
Publication:2408965
DOI10.1016/j.ejc.2017.06.001zbMath1371.05076arXiv1610.05406MaRDI QIDQ2408965
Alexandr V. Kostochka, Ilkyoo Choi, Jae-Hoon Kim, 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
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C07: Vertex degrees
05C42: Density (toughness, etc.)