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

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

<p class="p1">An edge-colored graph <em>G</em> is <em>rainbow</em> <em>k-connected</em>, if there are <em>k</em>-internally disjoint rainbow paths connecting every pair of vertices of <em>G</em>. The rainbow <em>k</...

Full description

Bibliographic Details
Main Authors: Bety Hayat Susanti, A.N.M. Salman, Rinovia Simanjuntak
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2020-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
cartesian product, 2-connected graph, rainbow $2$-connectivity, rainbow path
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/805

Internet

https://www.ejgta.org/index.php/ejgta/article/view/805

Similar Items