Graphs with two crossings are 5-choosable
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10103970" target="_blank" >RIV/00216208:11320/11:10103970 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1137/11082703X" target="_blank" >http://dx.doi.org/10.1137/11082703X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/11082703X" target="_blank" >10.1137/11082703X</a>
Alternative languages
Result language
angličtina
Original language name
Graphs with two crossings are 5-choosable
Original language description
A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen''s theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with at most two crossings is 5-choosable.
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>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
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
SIAM Journal on Discrete Mathematics
ISSN
0895-4801
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
1746-1753
UT code for WoS article
000298348400017
EID of the result in the Scopus database
—