Note on robust coloring of planar graphs
Combinatorics
2024-12-24 v2
Abstract
We consider the robust chromatic number of planar graphs and show that there exists an infinite family of planar graphs with , thus solving a recent problem of Bacs\'{o}~et~al. (The robust chromatic number of graphs, Graphs Combin. 40 (2024), #89).
Cite
@article{arxiv.2401.08324,
title = {Note on robust coloring of planar graphs},
author = {František Kardoš and Borut Lužar and Roman Soták},
journal= {arXiv preprint arXiv:2401.08324},
year = {2024}
}