Repository logo

Browsing by Subject "robust coloring"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Note on robust coloring of planar graphs
    (Wydawnictwa AGH, 2025) Kardoš, František; Lužar, Borut; Soták, Roman
    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].