Graphs with bounded tree-width and large odd-girth are almost bipartite
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10028804" target="_blank" >RIV/00216208:11320/10:10028804 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graphs with bounded tree-width and large odd-girth are almost bipartite
Original language description
We prove that every graph with bounded tree-width without short odd cycles has circular chromatic number arbitrarily close to two.
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 Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
100
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
6
Pages from-to
—
UT code for WoS article
000281907600004
EID of the result in the Scopus database
—