Fractional coloring of triangle-free planar graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10312991" target="_blank" >RIV/00216208:11320/15:10312991 - isvavai.cz</a>
Result on the web
<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p11" target="_blank" >http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p11</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fractional coloring of triangle-free planar graphs
Original language description
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3-3/(3n+1).
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
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
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
Electronic Journal of Combinatorics [online]
ISSN
1097-1440
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
7
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-84944747019