(Strong) rainbow connection number of three classes of graphs

DOI10.3969/J.ISSN.1008-5513.2018.03.010MaRDI QIDQ5382437zbMATHFDO

Authors Yan Zhao, Hang Chai

Publication date 21 June 2019

zbMATH Keywords

rainbow connectionrainbow pathrainbow connection numberrainbow geodesic

Mathematics Subject Classification ID

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

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

Cited in

(19)

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