From light edges to strong edge-colouring of 1-planar graphs
From MaRDI portal
Publication:5130733
DOI10.23638/DMTCS-22-1-2zbMath1452.05053OpenAlexW2949611418MaRDI QIDQ5130733
Eric Sopena, François Dross, Julien Bensmail, Hervé Hocquard
Publication date: 28 October 2020
Full work available at URL: https://hal.science/hal-02112188
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Light edges in 1‐planar graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 1-planarity of complete multipartite graphs
- Strong chromatic index of planar graphs with large girth
- Strong edge-colouring of sparse planar graphs
- Strong chromatic index of subcubic planar multigraphs
- The structure of 1-planar graphs
- The strong chromatic index of a cubic graph is at most 10
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Strong chromatic index of graphs with maximum degree four
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- On strong edge-colouring of subcubic graphs
- Induced matchings in cubic graphs
- Strong edge-coloring of planar graphs
This page was built for publication: From light edges to strong edge-colouring of 1-planar graphs