Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10437052" target="_blank" >RIV/00216208:11320/22:10437052 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/22:00127781
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=uVRdqLhy6V" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=uVRdqLhy6V</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2021.07.002" target="_blank" >10.1016/j.jctb.2021.07.002</a>

Result language
angličtina
Original language name
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Original language 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. (c) 2021 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-19503S" target="_blank" >GA14-19503S: Graph coloring and structure</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)