(Strong) rainbow connection number of three classes of graphs

DOI10.3969/J.ISSN.1008-5513.2018.03.010zbMATH Open1424.05113MaRDI QIDQ5382437FDOQ5382437

Authors: Yan Zhao, Hang Chai 

Publication date: 21 June 2019

Recommendations

• scientific article; zbMATH DE number 7144826
• Rainbow connection and graph products
• On the strong rainbow connection of a graph
• Rainbow connection in graphs
• Rainbow and strong rainbow connection number for some families of graphs

zbMATH Keywords

rainbow connectionrainbow pathrainbow connection numberrainbow geodesic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cited In (19)

• Title not available (Why is that?)
• Rainbow and strong rainbow connection number for some families of graphs
• Color code techniques in rainbow connection
• A solution to a conjecture on two rainbow connection numbers of a graph.
• The strong rainbow vertex-connection of graphs
• (Strong) rainbow connection on the splitting of 3-path
• Rainbow connections of graph joins
• Rainbow connectivity and proper rainbow connectivity of \(\theta(1,s,t)\)
• Distance-local rainbow connection number
• Rainbow connection numbers of ladders and Möbius ladders.
• (1, 2)-rainbow connection number at most 3 in connected dense graphs
• Rainbow connection in graphs
• Rainbow connection of the join of two paths.
• The strong 3-rainbow index of edge-comb product of a path and a connected graph
• A sharp upper bound for the strong rainbow connection number of a graph
• Rainbow subgraphs in edge-colored planar and outerplanar graphs
• On various (strong) rainbow connection numbers of graphs
• Rainbow connection and graph products
• Strong rainbow coloring of unicyclic graphs

This page was built for publication: (Strong) rainbow connection number of three classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382437)