| 1 |
Erős P. Problems and results in combinatorial analysis and graph theory[C]// Proceedings of the First Japan Conference on Graph Theory and Applications, 1988: 81-92.
|
| 2 |
Andersen I D . The strong chromatic index of a cubic graph is at most 10[J]. Discrete Mathematics, 1992, 108, 231- 252.
doi: 10.1016/0012-365X(92)90678-9
|
| 3 |
Hor$\acute{a}$k P , Qing H , Trotter W T . Induced matchings in cubic graphs[J]. Journal of Graph Theory, 1993, 17 (2): 151- 160.
doi: 10.1002/jgt.3190170204
|
| 4 |
Cranston D . Strong edge-coloring graphs with maximum degree 4 using 22 colors[J]. Discrete Mathematics, 2006, 306, 2772- 2778.
doi: 10.1016/j.disc.2006.03.053
|
| 5 |
Huang M , Santana M , Yu G . Strong chromatic index of graphs with maximum degree four[J]. Electronic Journal of Combinatorics, 2018, 25 (3): #P3.31.
|
| 6 |
Molloy M , Reed B . A bound on the strong chromatic index of a graph[J]. Journal of Combinatorial Theory B, 1997, 69 (2): 103- 109.
doi: 10.1006/jctb.1997.1724
|
| 7 |
Bruhn B , Joos F . A stronger bound for the strong chromatic index[J]. Combinatorics Probability & Computing, 2018, 27, 21- 43.
|
| 8 |
Bonamy M , Perrett T , Postle L . Colouring graphs with sparse neighbourhoods: bounds and Applications[J]. Journal of Combinatorial Theory, Series B, 2022, 155, 278- 317.
doi: 10.1016/j.jctb.2022.01.009
|
| 9 |
Faudree R J , Gya$\acute{a}$rfas A , Schelp R H , Tuza Zs . The strong chromatic index of graphs[J]. Ars Combinatoria, 1990, 29B, 205- 211.
|
| 10 |
Hud$\acute{a}$k D , Lu$\check{z}$ar B , Sot$\acute{a}$k R , et al. Strong edge-coloring of planar graph[J]. Discrete Mathematics, 2014, 324, 41- 49.
doi: 10.1016/j.disc.2014.02.002
|
| 11 |
Bensmail J , Harutyunyan A , Hocquard H , et al. Strong edge-coloring of sparse planar graphs[J]. Discrete Applied Mathematics, 2014, 179, 229- 234.
doi: 10.1016/j.dam.2014.07.006
|
), Heng ZHANG1
