Note on robust coloring of planar graphs
Abstract
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\'o~et~al. (The robust chromatic number of graphs, Graphs Combin. 40 (2024), #89).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.