Rainbow connection for some families of hypergraphs

@article{Carpentier2014RainbowCF,
  title={Rainbow connection for some families of hypergraphs},
  author={Rui Pedro Carpentier and Henry Liu and Manuel Silva and Teresa Sousa},
  journal={Discrete Mathematics},
  year={2014},
  volume={327},
  pages={40-50}
}
An edge-coloured path in a graph is rainbow if its edges have distinct colours. The rainbow connection number of a connected graph G, denoted by rc(G), is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by a rainbow path. The function rc(G) was first introduced by Chartrand et al. [Math. Bohem., 133 (2008), pp. 85-98], and has since attracted considerable interest. In this paper, we introduce two extensions of the rainbow connection… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Zs

  • Y. Caro, A. Lev, Y. Roditty
  • Tuza, and R. Yuster, On rainbow connection…
  • 2008
1 Excerpt

Modern Graph Theory

  • B. Bollobás
  • Springer-Verlag, New York
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…