Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph

An edge-colored graph G is rainbow k -connected, if for every two vertices of G , there are k internally disjoint rainbow paths, i.e., if no two edges of each path are colored the same. The minimum number of colors needed for which there exists a rainbow k -connected coloring of G , r c k ( G ) , is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the Indian Academy of Sciences. Mathematical sciences 2020-12, Vol.130 (1), Article 9
Hauptverfasser:	Bača, Martin, Salman, A N M, Simanjuntak, Rinovia, Susanti, Bety Hayat
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph coloring Graph theory Graphs Mathematics Mathematics and Statistics Orientation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!