Oriented diameter and rainbow connection number of a graph
From MaRDI portal
Publication:5167722
zbMath1294.05104arXiv1111.3480MaRDI QIDQ5167722
Xiaolong Huang, Yuefang Sun, Hengzhe Li, Xue Liang Li
Publication date: 1 July 2014
Full work available at URL: https://arxiv.org/abs/1111.3480
Related Items (10)
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter ⋮ Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ Rainbow connection number and graph operations ⋮ Improved bounds for the oriented radius of mixed multigraphs ⋮ Rainbow connections of graphs: a survey ⋮ The vertex-rainbow connection number of some graph operations ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ Rainbow connection number of graphs with diameter 3 ⋮ Algorithm on rainbow connection for maximal outerplanar graphs ⋮ The complexity of determining the vertex-rainbow index of graphs
This page was built for publication: Oriented diameter and rainbow connection number of a graph