Funder
Innovative Research Group Project of the National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Andersen, L.D.: The strong chromatic index of a cubic graph is at most $$10$$. Discrete Math. 108(1–3), 231–252 (1992)
2. Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. arXiv:1810.06704
3. Chen, L., Huang, M., Yu, G., Zhou, X.: The strong edge-coloring for graphs with small edge weight. Discrete Math. 343(4), 111779 (2020)
4. Chen, M., Hu, J., Yu, X., Zhou, S.: List strong edge coloring of planar graphs with maximum degree 4. Discrete Math. 342(5), 1471–1480 (2019)
5. Dai, T., Wang, G., Yang, D., Yu, G.: Strong list-chromatic index of subcubic graphs. Discrete Math. 341(12), 3434–3440 (2018)