Color code techniques in rainbow connection

DOI10.5614/EJGTA.2018.6.2.14MaRDI QIDQ5009997zbMATH OpenOpenAlexFDO

Authors Fendy Septyanto, K. A. Sugeng

Publication date 23 August 2021

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

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

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)

Recommendations

• Rainbow connection in graphs
• (Strong) rainbow connection number of three classes of graphs
• Rainbow connections of graph joins
• Rainbow connection of the join of two paths.
• scientific article; zbMATH DE number 6837036

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Bounds for the rainbow connection number of graphs
• Rainbow connection in graphs
• Rainbow connection number of amalgamation of some graphs
• Rainbow connections of graph joins

Cited in

(9)

• The rainbow k-connectivity of the non-commutative graph of a finite group
• On the rainbow connection numbers of line, middle, and total graphs of wheels
• Distance-local rainbow connection number
• Rainbow connection number of comb product of graphs
• (1, 2)-rainbow connection number at most 3 in connected dense graphs
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
• Mixing Color Coding-Related Techniques
• Rainbow connection number of corona product of graphs
• Rainbow Network Flow of Multiple Description Codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009997)