(1,0)-Relaxed strong edge list coloring of planar graphs with girth 6
From MaRDI portal
Publication:5207498
DOI10.1142/S1793830919500642zbMath1427.05062OpenAlexW2972864039WikidataQ127319381 ScholiaQ127319381MaRDI QIDQ5207498
Publication date: 2 January 2020
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830919500642
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Strong edge-colouring of sparse planar graphs
- On \((s,t)\)-relaxed strong edge-coloring of graphs
- The strong chromatic index of a cubic graph is at most 10
- A bound on the strong chromatic index of a graph
- Strong list-chromatic index of subcubic graphs
- On strong edge-colouring of subcubic graphs
- List strong edge coloring of some classes of graphs
- A Stronger Bound for the Strong Chromatic Index
- Semistrong edge coloring of graphs
This page was built for publication: (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6