The \((k,\ell)\)-rainbow index of random graphs
From MaRDI portal
Publication:263013
DOI10.1007/s40840-015-0301-3zbMath1333.05073arXiv1310.2934OpenAlexW1608855740MaRDI QIDQ263013
Qingqiong Cai, Jiangli Song, Xue Liang Li
Publication date: 4 April 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.2934
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (6)
The 3-rainbow index and connected dominating sets ⋮ The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs ⋮ Rainbow connectivity and rainbow index of inhomogeneous random graphs ⋮ Generalized rainbow connection of graphs ⋮ The \((k,\ell )\)-proper index of graphs ⋮ The vertex-rainbow index of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- On rainbow connection
- Rainbow connections of graphs: a survey
- Note on the hardness of rainbow connections for planar and line graphs
- On the strong rainbow connection of a graph
- The generalized connectivity of complete equipartition 3-partite graphs
- Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
- Rainbow connection number and connected dominating sets
- The rainbow connectivity of a graph
- Rainbow trees in graphs and generalized connectivity
- Rainbow connection in graphs
- The generalized connectivity of complete bipartite graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
This page was built for publication: The \((k,\ell)\)-rainbow index of random graphs