Rainbow connection number of graphs with diameter 3

DOI10.7151/DMGT.1920MaRDI QIDQ503673zbMATH OpenOpenAlexFDO

Authors Hengzhe Li, Yuefang Sun, Xueliang Li

Publication date 23 January 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1920

zbMATH Keywords

diameteredge coloringrainbow pathrainbow connection number

Mathematics Subject Classification ID

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

Recommendations

• Rainbow connection and forbidden subgraphs
• Rainbow connection in 3-connected graphs
• Rainbow connection of graphs with diameter 2
• Rainbow connection in graphs with minimum degree three
• Rainbow connection number and graph operations

Cites work

• Graph theory
• Hardness and algorithms for rainbow connection
• Oriented diameter and rainbow connection number of a graph
• Rainbow connection in graphs
• Rainbow connection number and radius
• Rainbow connection of graphs with diameter 2
• Rainbow connections for outerplanar graphs with diameter 2 and 3

Cited in

(7)

• Oriented diameter and rainbow connection number of a graph
• Rainbow connection number and graph operations
• Rainbow connection of graphs with diameter 2
• Rainbow connection number of biconnected outerplanar graphs with small diameters
• The vertex-rainbow connection number of some graph operations
• (1, 2)-rainbow connection number at most 3 in connected dense graphs
• Rainbow connection and forbidden subgraphs

This page was built for publication: Rainbow connection number of graphs with diameter 3

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