A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319507" target="_blank" >RIV/00216208:11320/15:10319507 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.21849" target="_blank" >http://dx.doi.org/10.1002/jgt.21849</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21849" target="_blank" >10.1002/jgt.21849</a>

Result language
angličtina
Original language name
A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems
Original language description
In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar result for the oriented chromatic number, from which follows in particular that graphs of large girth excluding a minor have oriented chromatic number at most 5, and for the pth chromatic number p, from which follows in particular that graphs G of large girth excluding a minor have chi(p)(G) <= p+2. (C) 2014 Wiley Periodicals, Inc.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)