Informace o publikaci
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
| Autoři | |
|---|---|
| Rok publikování | 2024 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Journal of Combinatorial Theory. Series B |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | https://www.sciencedirect.com/science/article/abs/pii/S0095895623000965 |
| Doi | http://dx.doi.org/10.1016/j.jctb.2023.11.001 |
| Klíčová slova | Coloring; Surfaces; Quadrangulations |
| Popis | We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.(c) 2023 Elsevier Inc. All rights reserved. |