Strong edge-coloring of planar graphs
From MaRDI portal
Abstract: A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We show that 3D + 6 colors suffice if the graph has girth 6, and 3D colors suffice if the girth is at least 7. Moreover, we show that cubic planar graphs with girth at least 6 can be strongly edge colored with at most 9 colors.
Recommendations
- Strong edge-coloring of planar graphs
- Strong edge coloring of specific planar graphs
- Strong edge-colouring of sparse planar graphs
- Strong edge-coloring for planar graphs with large girth
- Strong edge-colorings of planar graphs with small girth
- Strong edge colorings of graphs
- Strong edge-coloring of subcubic planar graphs
- scientific article; zbMATH DE number 3882451
- Strong edge-coloring of planar graphs without short cycles
- scientific article; zbMATH DE number 1541634
Cites work
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- A bound on the strong chromatic index of a graph
- Every planar graph with maximum degree 7 is of class 1
- Induced matchings in cubic graphs
- On induced matchings
- On strong edge-colouring of subcubic graphs
- Problems and results in combinatorial analysis and graph theory
- Strong edge colouring of subcubic graphs
- The strong chromatic index of a cubic graph is at most 10
Cited in
(37)- Strong edge coloring of Cayley graphs and some product graphs
- Strong edge-colouring and induced matchings
- scientific article; zbMATH DE number 3882451 (Why is no real title available?)
- \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- Strong edge-colorings of planar graphs with small girth
- Strong edge coloring of Goldberg snark
- On strong incidence coloring of subcubic graphs
- Strong chromatic indices of certain binary operations on graphs
- Strong edge-coloring of subcubic planar graphs
- On the precise value of the strong chromatic index of a planar graph with a large girth
- Subcubic planar graphs of girth 7 are class I
- Strong cliques in claw-free graphs
- The strong chromatic index of 1-planar graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Strong edge-coloring of planar graphs without short cycles
- Strong edge-colouring of sparse planar graphs
- Strong chromatic index of planar graphs with large girth
- Facial \(L(2, 1)\)-edge-labelings of trees
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- The strong edge-coloring for graphs with small edge weight
- Strong edge-coloring of pseudo-Halin graphs
- Strong list-chromatic index of planar graphs with Ore-degree at most seven
- Strong chromatic index of \(K_{1, t}\)-free graphs
- Semistrong edge colorings of planar graphs
- Strong edge-coloring of planar graphs
- From light edges to strong edge-colouring of 1-planar graphs
- Strong chromatic index of subcubic planar multigraphs
- Upper bounds for the strong chromatic index of Halin graphs
- Strong edge-coloring for jellyfish graphs
- Strong chromatic index of K₄-minor free graphs
- Recent progress on strong edge-coloring of graphs
- Strong incidence coloring of outerplanar graphs
- Strong edge-coloring for planar graphs with large girth
- On the strong chromatic index of sparse graphs
- Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs
- Strong edge coloring of specific planar graphs
This page was built for publication: Strong edge-coloring of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920291)
