Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable

For planar graphs, we consider the problems of <i>list edge coloring</i> and <i>list total coloring</i>. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total coloring is the problem of coloring the edges and the vertices w...

Descripció completa

Dades bibliogràfiques

Autors principals:	Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
Format:	Artigo
Idioma:	Inglês
Publicat:	Discrete Mathematics & Theoretical Computer Science 2016-05-01
Col·lecció:	Discrete Mathematics & Theoretical Computer Science
Matèries:	planar graphs discharging edge coloring [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
Accés en línia:	https://dmtcs.episciences.org/2147/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!