Rainbow connections for outerplanar graphs with diameter 2 and 3

DOI10.1016/j.amc.2014.05.066zbMath1334.05038OpenAlexW1991059700MaRDI QIDQ279540

Xiaolong Huang, Yan Zhao, Yongtang Shi, Jun Yue, Xue Liang Li

Publication date: 28 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.05.066

zbMATH Keywords

diametercoloringouterplanar graphrainbow connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Hardness results for total rainbow connection of graphs ⋮ Some results on the total proper \(k\)-connection number ⋮ Some results on the 3-total-rainbow index ⋮ Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ Injective coloring of some graph operations ⋮ Rainbow connection number and graph operations ⋮ Graphs with small total rainbow connection number ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ The vertex-rainbow connection number of some graph operations ⋮ The generalized 3-connectivity of star graphs and bubble-sort graphs ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ Rainbow connection number of graphs with diameter 3 ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ The complexity of determining the vertex-rainbow index of graphs ⋮ Total rainbow connection numbers of some special graphs

Cites Work

• Unnamed Item
• Rainbow connection in 3-connected graphs
• Rainbow connection of graphs with diameter 2
• Rainbow connection number and connectivity
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• On rainbow connection
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• The hitting time of rainbow connection number two
• Note on the hardness of rainbow connections for planar and line graphs
• On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
• Graphs with rainbow connection number two
• Rainbow Connectivity of Sparse Random Graphs
• Rainbow connection in graphs
• Rainbow Connection of Random Regular Graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Hardness and Algorithms for Rainbow Connectivity
• On the threshold for rainbow connection number \(r\) in random graphs

This page was built for publication: Rainbow connections for outerplanar graphs with diameter 2 and 3