Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations

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

Result language
angličtina
Original language name
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
Original language description
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.
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)