Note on robust coloring of planar graphs
Loading...
Date
Presentation Date
Editor
Other contributors
Other title
Resource type
Version
wersja wydawnicza
Pagination/Pages:
pp. 103-111
Research Project
Description
Abstract
We consider the robust chromatic number $\chi_1(G)$ of planar graphs $G$ and show that there exists an infinite family of planar graphs $G$ with $\chi_1(G) = 3$, thus solving a recent problem of Bacsó et al. from [The robust chromatic number of graphs, Graphs Combin. 40 (2024), #89].