3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10312987" target="_blank" >RIV/00216208:11320/15:10312987 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.21842" target="_blank" >http://dx.doi.org/10.1002/jgt.21842</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21842" target="_blank" >10.1002/jgt.21842</a>
Alternative languages
Result language
angličtina
Original language name
3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle
Original language description
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
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)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
80
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
98-111
UT code for WoS article
000359380300002
EID of the result in the Scopus database
2-s2.0-84938951795