The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

DOI10.5614/ejgta.2020.8.1.11zbMath1468.05087OpenAlexW3015129592MaRDI QIDQ4957978

A. N. M. Salman, Bety Hayat Susanti, Rinovia Simanjuntak

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2020.8.1.11

zbMATH Keywords

Cartesian productrainbow path2-connected graphrainbow \(2\)-connectivity

Mathematics Subject Classification ID

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

Related Items (3)

Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs ⋮ Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow connection number of amalgamation of some graphs
• On rainbow-\(k\)-connectivity of random graphs
• Rainbow connection number of graph power and graph products
• Hardness and algorithms for rainbow connection
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Rainbow connections of graphs: a survey
• A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
• Rainbow connection and graph products
• Rainbow 2-connection numbers of Cayley graphs
• The rainbow connectivity of a graph
• The rainbow $k$-connectivity of two classes of graphs
• Rainbow connection in graphs
• Color code techniques in rainbow connection

This page was built for publication: The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths