We consider the robust chromatic number $χ_1(G)$ of planar graphs $G$ and show that there exists an infinite family of planar graphs $G$ with $χ_1(G) = 3$, thus solving a recent problem of Bacsó~et~al. (The robust chromatic number of graphs, Graphs Combin. 40 (2024), #89).
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。