Colorings of Plane Graphs Without Long Monochromatic Facial Paths
Let G be a plane graph. A facial path of G is a subpath of the boundary walk of a face of G. We prove that each plane graph admits a 3-coloring (a 2-coloring) such that every monochromatic facial path has at most 3 vertices (at most 4 vertices). These results are in a contrast with the results of Ch...
Spremljeno u:
| Glavni autori: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
University of Zielona Góra
2021-08-01
|
| Serija: | Discussiones Mathematicae Graph Theory |
| Teme: | |
| Online pristup: | https://doi.org/10.7151/dmgt.2319 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|