Rainbow connection of graphs with diameter 2

DOI10.1016/J.DISC.2012.01.009zbMath1237.05118arXiv1101.2765OpenAlexW2111653511MaRDI QIDQ408184

Sujuan Liu, Hengzhe Li, Xue Liang Li

Publication date: 29 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

edge-coloringdiameterrainbow connection numberrainbow path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Connectivity (05C40)

Related Items (15)

Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ Rainbow connection number of amalgamation of some graphs ⋮ Rainbow connection number and graph operations ⋮ Upper bounds of proper connection number of graphs ⋮ Rainbow connections of graphs: a survey ⋮ Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 ⋮ Rainbow connection for some families of hypergraphs ⋮ The vertex-rainbow connection number of some graph operations ⋮ Rainbow connection number of graphs with diameter 3 ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Algorithm on rainbow connection for maximal outerplanar graphs ⋮ Conflict-free connection number and independence number of a graph ⋮ Total rainbow connection numbers of some special graphs ⋮ Proper connection numbers of complementary graphs ⋮ Rainbow connection and forbidden subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Hardness and algorithms for rainbow connection
• Rainbow connections of graphs: a survey
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

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