All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Finite families of forbidden subgraphs for rainbow connection in graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43928709" target="_blank" >RIV/49777513:23520/16:43928709 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.disc.2016.02.015" target="_blank" >http://dx.doi.org/10.1016/j.disc.2016.02.015</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.disc.2016.02.015" target="_blank" >10.1016/j.disc.2016.02.015</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Finite families of forbidden subgraphs for rainbow connection in graphs

  • Original language description

    A connected edge-colored graph G is rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors; the rainbow connection number rc(G) of G is the minimum number of colors such that G is rainbow-connected. We consider families F of connected graphs for which there is a constant k such that, for every connected F-free graph G, rc(G) is at most diam(G)+k, where diam(G) is the diameter of G. In the paper, we finalize our previous considerations and give a complete answer for any finite family F.

  • 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)

Others

  • Publication year

    2016

  • 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

    DISCRETE MATHEMATICS

  • ISSN

    0012-365X

  • e-ISSN

  • Volume of the periodical

    339

  • Issue of the periodical within the volume

    9

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    9

  • Pages from-to

    2304-2312

  • UT code for WoS article

  • EID of the result in the Scopus database