2-distance list (\Delta+2)-coloring of planar graphs with girth at least 10

DOI10.1007/S10878-022-00883-WMaRDI QIDQ6378937arXivFDO

Authors Hoang La, Mickaël Montassier

Publication date 29 September 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10878-022-00883-W

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

arXiv classification

cs.DMmath.CO

Abstract: Given a graph $G$ and a list assignment $L(v)$ for each vertex of $v$ of $G$. A proper $L$-list-coloring of $G$ is a function that maps every vertex to a color in $L(v)$ such that no pair of adjacent vertices have the same color. We say that a graph is list $k$-colorable when every vertex $v$ has a list of colors of size at least $k$. A $2$-distance coloring is a coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance list ($Delta+2$)-coloring for planar graphs with girth at least $10$ and maximum degree $Deltageq4$.

This page was built for publication: $2$-distance list $(\Delta+2)$-coloring of planar graphs with girth at least 10

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6378937)