Strong edge-colouring of sparse planar graphs
From MaRDI portal
Publication:477354
DOI10.1016/j.dam.2014.07.006zbMath1303.05057arXiv1401.4568OpenAlexW2067104586MaRDI QIDQ477354
Julien Bensmail, Petru Valicov, Hervé Hocquard, Ararat Harutyunyan
Publication date: 3 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4568
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Strong edge-coloring for planar graphs with large girth ⋮ Strong edge coloring sparse graphs ⋮ Facial \(L(2, 1)\)-edge-labelings of trees ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ Strong incidence coloring of outerplanar graphs ⋮ Strong chromatic index of generalized Jahangir graphs and generalized Helm graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ 子立方平面图的$(1,0)$-松弛强边列表染色 ⋮ (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6 ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ Strong edge-coloring of planar graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ From light edges to strong edge-colouring of 1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Edge coloring of embedded graphs with large girth
- Planar graphs of maximum degree seven are Class I
- On strong edge-colouring of subcubic graphs
- Induced matchings in cubic graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- Strong edge-coloring of planar graphs
- Every planar graph with maximum degree 7 is of class 1
