Note on robust coloring of planar graphs
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. from [The robust chromatic number of graphs, Graphs Combin.40 (2024), #89].
Authors
- František Kardoš (ORCID: https://orcid.org/0000-0002-9826-2927)
- Roman Soták (ORCID: https://orcid.org/0000-0002-0667-0019)
- Borut Lužar (ORCID: https://orcid.org/0000-0002-8356-8827)
Publication Details
- Journal
- Opuscula Mathematica
- Published
- 2024-12-20
- DOI
- https://doi.org/10.7494/opmath.2025.45.1.103
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Javna Agencija za Raziskovalno Dejavnost RS
- Agentúra na Podporu Výskumu a Vývoja
- Vedecká Grantová Agentúra MŠVVaŠ SR a SAV