List strong edge-colorings of sparse graphs
From MaRDI portal
Publication:6090823
DOI10.1007/s40840-023-01594-zzbMath1527.05065OpenAlexW4387696211MaRDI QIDQ6090823
Kecai Deng, Xiangqian Zhou, Haiyang Zhang, Ningge Huang
Publication date: 20 November 2023
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-023-01594-z
Cites Work
- Unnamed Item
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs
- A note on the strong chromatic index of bipartite graphs
- The strong chromatic index of a class of graphs
- The strong chromatic index of a cubic graph is at most 10
- Incidence and strong edge colorings of graphs
- Strong chromatic index of graphs with maximum degree four
- List strong edge coloring of planar graphs with maximum degree 4
- Strong list-chromatic index of subcubic graphs
- On incidence choosability of cubic graphs
- List strong edge-coloring of graphs with maximum degree 4
- The strong edge-coloring for graphs with small edge weight
- Induced matchings in cubic graphs
- On Representatives of Subsets