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%2F23%3A10476716" target="_blank" >RIV/00216208:11320/23:10476716 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-055" target="_blank" >https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-055</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-055" target="_blank" >10.5817/CZ.MUNI.EUROCOMB23-055</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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

    2023

  • 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

  • Article name in the collection

    Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications

  • ISBN

    978-80-280-0344-9

  • ISSN

    2788-3116

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    393-400

  • Publisher name

    Masaryk University Press

  • Place of publication

    Masaryk University, Brno

  • Event location

    Praha

  • Event date

    Aug 28, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article