The rainbow connection number of 2-connected graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43918757" target="_blank" >RIV/49777513:23520/13:43918757 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.disc.2012.04.022" target="_blank" >http://dx.doi.org/10.1016/j.disc.2012.04.022</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2012.04.022" target="_blank" >10.1016/j.disc.2012.04.022</a>

Result language
angličtina
Original language name
The rainbow connection number of 2-connected graphs
Original language description
The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. In the paper we prove that the rainbow connection number of every 2-connected graph with n vertices is at most the upper integer part of n/2. The bound is optimal.
Czech name
—
Czech description
—

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

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
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
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)