The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs

DOI10.1007/s40840-016-0348-9zbMath1344.05043arXiv1310.2783OpenAlexW2271714917MaRDI QIDQ310735

Jiangli Song, Qingqiong Cai, Xue Liang Li

Publication date: 8 September 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

probabilistic methodrainbow index(bipartite) Ramsey numbercomplete bipartite (multipartite) graphs

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

The 3-rainbow index and connected dominating sets ⋮ Proper connection number of graph products ⋮ Generalized rainbow connection of graphs ⋮ The \((k,\ell )\)-proper index of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((k,\ell)\)-rainbow index of random graphs
• On extremal graphs with internally disjoint Steiner trees
• Rainbow connections of graphs: a survey
• The generalized connectivity of complete equipartition 3-partite graphs
• Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• A partition calculus in set theory
• Rainbow connection in graphs
• A new upper bound for the bipartite Ramsey problem
• On Finite Polarized Partition Relations