(1, 2)-rainbow connection number at most 3 in connected dense graphs

DOI10.5614/ejgta.2023.11.2.6zbMath1527.05074MaRDI QIDQ6090318

Unnamed Author, Trung Duy Doan

Publication date: 16 December 2023

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

zbMATH Keywords

edge-colouringrainbow connection\((1, 2)\)-rainbow connection

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Hardness and algorithms for rainbow connection
• Proper connection number 2, connectivity, and forbidden subgraphs
• On the minimum degree and the proper connection number of graphs
• Generalized rainbow connection of graphs and their complements
• Rainbow connections of graphs: a survey
• Hardness results for three kinds of colored connections of graphs
• Generalized rainbow connection of graphs
• Rainbow connection in graphs
• Maximal circuits of graphs. I
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
• Color code techniques in rainbow connection
• Rainbow connection number of comb product of graphs

This page was built for publication: (1, 2)-rainbow connection number at most 3 in connected dense graphs