All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Precoloring extension in planar near-Eulerian-triangulations

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10513661" target="_blank" >RIV/00216208:11320/25:10513661 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ZKSFLrjVk9" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ZKSFLrjVk9</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ejc.2025.104138" target="_blank" >10.1016/j.ejc.2025.104138</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Precoloring extension in planar near-Eulerian-triangulations

  • Original language description

    We consider the 4-precoloring extension problem in planar near-Eulerian- triangulations, i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even degree, and exactly the vertices incident with the outer face are precolored. We give a necessary topological condition for the precoloring to extend, and give a complete characterization when the outer face has length at most five and when all vertices of the outer face have odd degree and are colored using only three colors. (c) 2025 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • Project

    <a href="/en/project/GA22-17398S" target="_blank" >GA22-17398S: Flows and cycles in graphs on surfaces</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2025

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    European Journal of Combinatorics

  • ISSN

    0195-6698

  • e-ISSN

    1095-9971

  • Volume of the periodical

    127

  • Issue of the periodical within the volume

    June 2025

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    15

  • Pages from-to

    104138

  • UT code for WoS article

    001443061400001

  • EID of the result in the Scopus database

    2-s2.0-86000152704