Colored homomorphism of Colored and Mixed Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F00%3A00001528" target="_blank" >RIV/00216208:11320/00:00001528 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Colored homomorphism of Colored and Mixed Graphs
Original language description
Generalizing earlier results of Sopena, Raspaud and Alon, Marshall it is established that colored mixed (i.e. both undirected and oriented) graphs have bounded chromatic number which respects color and orientations.
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/GA201%2F99%2F0242" target="_blank" >GA201/99/0242: DIMATIA - center of discrete mathematics, theoretical computer science and applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2000
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 Combinatorial Theory
ISSN
—
e-ISSN
—
Volume of the periodical
—
Issue of the periodical within the volume
80
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—