EUVIMEDEUVIMED entdecken
Crossref

Note on robust coloring of planar graphs

František Kardoš, Borut Lužar, Roman Soták

Opuscula Mathematica · 2025 · 103-111

DOI: 10.7494/opmath.2025.45.1.103 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Opuscula Mathematica, 2025. Verfasst von František Kardoš und 2 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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].

Zitieren

APA

Kardoš, F., Lužar, B., & Soták, R. (2025). Note on robust coloring of planar graphs. Opuscula Mathematica, 103-111. https://doi.org/10.7494/opmath.2025.45.1.103

Vancouver

Kardoš F, Lužar B, Soták R. Note on robust coloring of planar graphs. Opuscula Mathematica. 2025:103-111. doi:10.7494/opmath.2025.45.1.103

BibTeX
@article{Kardo2025,
  author = {Kardoš, František and Lužar, Borut and Soták, Roman},
  title = {Note on robust coloring of planar graphs},
  journal = {Opuscula Mathematica},
  year = {2025},
  pages = {103--111},
  doi = {10.7494/opmath.2025.45.1.103}
}
Kostenlos starten →