Publication details
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
| Authors | |
|---|---|
| Year of publication | 2022 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Combinatorial Theory. Series B |
| MU Faculty or unit | |
| Citation | |
| web | http://doi.org/10.1016/j.jctb.2021.07.002 |
| Doi | http://dx.doi.org/10.1016/j.jctb.2021.07.002 |
| Keywords | Coloring; Surfaces; Triangle-free |
| Description | We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring of a bounded number of vertices. |