Cargando…

Coloring triangle‐free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow‐up work of Bernshteyn) on the (list) chromatic number of triangle‐free graphs. In both our results, we permit the amount of color made available to vertices of lower degree to be accordingly lower....

Descripción completa

Detalles Bibliográficos
Autores principales: Davies, Ewan, de Joannis de Verclos, Rémi, Kang, Ross J., Pirot, François
Formato: Online Artículo Texto
Lenguaje:English
Publicado: John Wiley & Sons, Inc. 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7508179/
https://www.ncbi.nlm.nih.gov/pubmed/32999582
http://dx.doi.org/10.1002/rsa.20945