Upper bound involving parameter \(\sigma_2\) for the rainbow connection number

DOI10.1007/s10255-013-0247-xzbMath1283.05091OpenAlexW1997126437MaRDI QIDQ2439242

Jiu-ying Dong, Xue Liang Li

Publication date: 14 March 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-013-0247-x

zbMATH Keywords

rainbow connectionrainbow coloringconnected two-step dominating setparameter \(\sigma_2(G)\)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (1)

Rainbow connection number and independence number of a graph

Cites Work

• On rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs
• Hardness and Algorithms for Rainbow Connectivity

This page was built for publication: Upper bound involving parameter \(\sigma_2\) for the rainbow connection number