Flexibility of planar graphs without $C_4$ and $C_5$
From MaRDI portal
Publication:6342454
arXiv2006.05243MaRDI QIDQ6342454
Publication date: 8 June 2020
Abstract: Let $G$ be a ${C_4, C_5}$-free planar graph with a list assignment $L$. Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least four, then there exists an $L$-coloring respecting at least a constant fraction of the preferences.
This page was built for publication: Flexibility of planar graphs without $C_4$ and $C_5$
