Proper rainbow connection number of graphs

DOI10.7151/DMGT.2326zbMath1459.05077arXiv1911.01118OpenAlexW3028205641MaRDI QIDQ2656335

Trung Duy Doan, Ingo Schiermeyer

Publication date: 11 March 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.01118

zbMATH Keywords

edge-colouringrainbow connection numberproper rainbow connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
• The complexity of determining the rainbow vertex-connection of a graph
• On rainbow connection
• Rainbow connections of graphs: a survey
• On proper (strong) rainbow connection of graphs
• Rainbow connection number of dense graphs
• On the rainbow vertex-connection
• Rainbow connection in sparse graphs
• Rainbow connection number and connected dominating sets
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• The chromatic index of complete multipartite graphs
• The strong rainbow vertex-connection of graphs

This page was built for publication: Proper rainbow connection number of graphs