Rainbow connection number and independence number of a graph

DOI10.1007/s00373-016-1704-0zbMath1351.05072arXiv1204.4298OpenAlexW1552361948MaRDI QIDQ343733

Xue Liang Li, Jiu-ying Dong

Publication date: 29 November 2016

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

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

zbMATH Keywords

independence numberconnected dominating setrainbow connection numberrainbow coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 ⋮ Conflict-free connection number and independence number of a graph

Cites Work

• Unnamed Item
• The rainbow connection number of 2-connected graphs
• Rainbow connection number and connectivity
• Hardness and algorithms for rainbow connection
• Rainbow connection number and radius
• On rainbow connection
• Rainbow connections of graphs: a survey
• Upper bound involving parameter \(\sigma_2\) for the rainbow connection number
• Rainbow connection number and connected dominating sets
• Bounds for the rainbow connection number of graphs
• Circumferences of k-connected graphs involving independence numbers
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• Rainbow connection numbers and the minimum degree sum of a graph
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Rainbow connection number and independence number of a graph