Nordhaus-Gaddum-type theorem for rainbow connection number of graphs

DOI10.1007/s00373-012-1183-xzbMath1272.05044arXiv1012.2641OpenAlexW2000391936MaRDI QIDQ367076

Lily Chen, Hui-shu Lian, Xue Liang Li

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

edge-colored graphrainbow connection numberNordhaus-Gaddum-type

Mathematics Subject Classification ID

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

Related Items (11)

The rainbow vertex-index of complementary graphs ⋮ Total rainbow connection number and complementary graph ⋮ More on the rainbow disconnection in graphs ⋮ Rainbow connections of graphs: a survey ⋮ On conflict-free connection of graphs ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings ⋮ The (vertex-)monochromatic index of a graph ⋮ Proper connection numbers of complementary graphs ⋮ The vertex-rainbow index of a graph

Cites Work

• Nordhaus-Gaddum inequalities for domination in graphs
• Rainbow connections of graphs: a survey
• Rainbow connection number and connected dominating sets
• On Complementary Graphs
• Rainbow connection in graphs
• The Diameter of a Graph and its Complement
• Unnamed Item
• Unnamed Item

This page was built for publication: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs