Rainbow connection number and connectivity
From MaRDI portal
Publication:426778
zbMath1243.05133arXiv1105.5704MaRDI QIDQ426778
L. Sunil Chandran, Deepak Rajendraprasad, Rogers Mathew, Sujuan Liu, Xue Liang Li
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.5704
connectivitygirthchordal graphear decompositionrainbow connection numberrainbow coloring2-connected graph
Related Items (18)
Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ Some results on the 3-total-rainbow index ⋮ Rainbow connection number and independence number of a graph ⋮ Rainbow connection numbers of Cayley graphs ⋮ The rainbow connection number of 2-connected graphs ⋮ Unnamed Item ⋮ Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ Rainbow connections of graphs: a survey ⋮ The vertex-rainbow connection number of some graph operations ⋮ Rainbow connection number of graph power and graph products ⋮ Rainbow connection number and the number of blocks ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ Algorithm on rainbow connection for maximal outerplanar graphs ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ Total rainbow connection numbers of some special graphs ⋮ Rainbow connectivity of Moore cages of girth 6 ⋮ Rainbow connection number and radius ⋮ Note on the hardness of rainbow connections for planar and line graphs
This page was built for publication: Rainbow connection number and connectivity