Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10030357" target="_blank" >RIV/00216208:11320/10:10030357 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
Original language description
We prove upper bounds on the number of colors in non-rainbow colorings of planar 3-, 4- and 5-connected graphs. Our bounds are best possible for 3- and 4-connected graphs.
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>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
63
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
—
UT code for WoS article
000273584500004
EID of the result in the Scopus database
—