A note on strong edge coloring of sparse graphs
From MaRDI portal
Publication:1734962
DOI10.1007/S10114-018-7186-7zbMATH Open1411.05087OpenAlexW2905501896WikidataQ128760993 ScholiaQ128760993MaRDI QIDQ1734962FDOQ1734962
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
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the degrees of the vertices of a directed graph
- A bound on the strong chromatic index of a graph
- The strong chromatic index of sparse graphs
- Problems and results in combinatorial analysis and graph theory
- The strong chromatic index of a cubic graph is at most 10
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Induced matchings in cubic graphs
- Strong Chromatic Index of 2-Degenerate Graphs
- Strong chromatic index of \(k\)-degenerate graphs
- Strong chromatic index of sparse graphs
- Strong edge-colorings for \(k\)-degenerate graphs
Cited In (6)
- Strong edge coloring sparse graphs
- Strong edge-colouring of sparse planar graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- On strongly spanning k-edge-colorable subgraphs
- On the chromatic number of a family of odd hole free graphs
- Strong edge-colorings of sparse graphs with large maximum degree
This page was built for publication: A note on strong edge coloring of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734962)
