From light edges to strong edge-colouring of 1-planar graphs

A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$. A conjecture of Erd\H{o}s and Ne\v{s}et\v{r}il, stated b...

Cijeli opis

Bibliografski detalji

Glavni autori:	Julien Bensmail, François Dross, Hervé Hocquard, Eric Sopena
Format:	Artigo
Jezik:	Inglês
Izdano:	Discrete Mathematics & Theoretical Computer Science 2020-01-01
Serija:	Discrete Mathematics & Theoretical Computer Science
Teme:	light edges strong edge-colouring strong chromatic index 1-planar graphs [info.info-dm]computer science [cs]/discrete mathematics [cs.dm]
Online pristup:	https://dmtcs.episciences.org/5404/pdf
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!