Color code techniques in rainbow connection

DOI10.5614/ejgta.2018.6.2.14zbMath1467.05085OpenAlexW2896822460MaRDI QIDQ5009997

Fendy Septyanto, Kiki A. Sugeng

Publication date: 23 August 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.2018.6.2.14

zbMATH Keywords

independencecliquerainbow connectioncolor codecommon neighborhood

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Rainbow connection number of comb product of graphs ⋮ Distance-local rainbow connection number ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs ⋮ The rainbow $k$--connectivity of the non-commutative graph of a finite group ⋮ The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

Cites Work

• Rainbow connection number of amalgamation of some graphs
• Rainbow connections of graphs: a survey
• Bounds for the rainbow connection number of graphs
• Rainbow connection in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Color code techniques in rainbow connection