Antisymmetric flows and strong oriented coloring of planar graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F03%3A00002847" target="_blank" >RIV/00216208:11320/03:00002847 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Antisymmetric flows and strong oriented coloring of planar graphs
Original language description
We give an upper bound on the number of colors needed for a strong oriented coloring of a planar graph, and hereby we find a small antisymmetric flow for any planar 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
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>
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
2003
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
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
273
Issue of the periodical within the volume
1-3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
203-209
UT code for WoS article
—
EID of the result in the Scopus database
—