Strong edge-coloring of planar graphs
From MaRDI portal
Publication:5920291
DOI10.1016/j.disc.2014.02.002zbMath1284.05101arXiv1303.4580OpenAlexW2093606884MaRDI QIDQ5920291
David E. Hudak, Borut Lužar, Roman Soták, Riste Škrekovski
Publication date: 20 March 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.4580
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (20)
Strong edge-coloring for planar graphs with large girth ⋮ On the strong chromatic index of 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 planar graphs with small girth ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ 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 ⋮ Strong edge-coloring of subcubic planar graphs ⋮ Strong edge-colouring of sparse planar graphs ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ Strong cliques in claw-free graphs ⋮ Strong edge-coloring of planar graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ From light edges to strong edge-colouring of 1-planar graphs ⋮ Strong edge coloring of Cayley graphs and some product graphs
Cites Work
- Unnamed Item
- Strong edge colouring of subcubic graphs
- On induced matchings
- 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
- On strong edge-colouring of subcubic graphs
- Induced matchings in cubic graphs
- Every planar graph with maximum degree 7 is of class 1
This page was built for publication: Strong edge-coloring of planar graphs