Note on robust coloring of planar graphs
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].
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Jezik: | English |
| Izdano: |
AGH Univeristy of Science and Technology Press
2024-12-01
|
| Serija: | Opuscula Mathematica |
| Teme: | |
| Online dostop: | https://www.opuscula.agh.edu.pl/vol45/1/art/opuscula_math_4507.pdf |