The distance-t chromatic index of graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F14%3A43921171" target="_blank" >RIV/49777513:23520/14:43921171 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1017/S0963548313000473" target="_blank" >http://dx.doi.org/10.1017/S0963548313000473</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/S0963548313000473" target="_blank" >10.1017/S0963548313000473</a>
Alternative languages
Result language
angličtina
Original language name
The distance-t chromatic index of graphs
Original language description
We obtain two results for the distance-t chromatic index of graphs of maximum degree D. The first one is an upper bound of (2-epsilon)D^t, where epsilon is a constant independent of t. The second result is an improved upper bound for graphs of girth at least 2t+1.
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/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
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
COMBINATORICS PROBABILITY & COMPUTING
ISSN
0963-5483
e-ISSN
—
Volume of the periodical
23
Issue of the periodical within the volume
1
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
90-101
UT code for WoS article
—
EID of the result in the Scopus database
—