A note on strong edge coloring of sparse graphs
From MaRDI portal
Publication:1734962
DOI10.1007/s10114-018-7186-7zbMath1411.05087WikidataQ128760993 ScholiaQ128760993MaRDI QIDQ1734962
Publication date: 27 March 2019
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-018-7186-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong chromatic index of sparse graphs
- Strong edge-colorings for \(k\)-degenerate graphs
- 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 the degrees of the vertices of a directed graph
- Strong Chromatic Index of Sparse Graphs
- Induced matchings in cubic graphs
- Strong Chromatic Index of 2-Degenerate Graphs