Note on robust coloring of planar graphs
- 1 January 2025
- journal article
- Published by AGH University Press in Opuscula Mathematica
- Vol. 45 (1) , 103-111
Abstract
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].
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- The Robust Chromatic Number of GraphsGraphs and Combinatorics, 2024
- Extremal Graph Theoretic Questions for q-Ary VectorsGraphs and Combinatorics, 2024
- A Note on Not-4-List Colorable Planar GraphsThe Electronic Journal of Combinatorics, 2018
- Graphs on Surfaces2001
- Five-Coloring Graphs on the TorusJournal of Combinatorial Theory, Series B, 1994
- The number of cycles in 2-factors of cubic graphsDiscrete Mathematics, 1990
- On Hamiltonian CircuitsJournal of the London Mathematical Society, 1946
- 2-Isomorphic GraphsAmerican Journal of Mathematics, 1933
- Die Theorie der regulären graphsActa Mathematica, 1891