3-coloring triangle-free planar graphs with a precolored 9-cycle
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43950259" target="_blank" >RIV/49777513:23520/18:43950259 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S019566981730118X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S019566981730118X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2017.07.010" target="_blank" >10.1016/j.ejc.2017.07.010</a>
Alternative languages
Result language
angličtina
Original language name
3-coloring triangle-free planar graphs with a precolored 9-cycle
Original language description
Given a triangle-free planar graph G and a 9-cycle C in G, we characterize situations where a 3-coloring of C does not extend to a proper 3-coloring of G. This extends previous results when C is a cycle of length at most 8.
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
10102 - Applied mathematics
Result continuities
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)
Others
Publication year
2018
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
—
Volume of the periodical
68
Issue of the periodical within the volume
February
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
28
Pages from-to
38-65
UT code for WoS article
000416613200004
EID of the result in the Scopus database
2-s2.0-85028302363