Concentration of rainbow \(k\)-connectivity of a multiplex random graph
From MaRDI portal
Publication:2689447
DOI10.1016/j.tcs.2023.113771OpenAlexW4319878690MaRDI QIDQ2689447
Publication date: 10 March 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113771
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (2)
Rainbow connectivity and rainbow index of inhomogeneous random graphs ⋮ Optimal secret share distribution in degree splitting communication networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on rainbow connectivity
- On rainbow-\(k\)-connectivity of random graphs
- On the chromatic number of random graphs
- On rainbow connection
- Radius, diameter, and minimum degree
- The concentration of the chromatic number of random graphs
- Rainbow connections of graphs: a survey
- Rainbow connection of sparse random graphs
- Rainbow \(k\)-connectivity of random bipartite graphs
- On the rainbow matching conjecture for 3-uniform hypergraphs
- From one to many rainbow Hamiltonian cycles
- Rainbow connection number and connected dominating sets
- Introduction to Random Graphs
- The rainbow connectivity of a graph
- On the strength of connectedness of a random graph
- On a rainbow version of Dirac's theorem
- Rainbow connection in graphs
- Rainbow Connection of Random Regular Graphs
- Multilayer Networks
- The Diameter of Sparse Random Graphs
- Sharp concentration of the equitable chromatic number of dense random graphs
- A rainbow version of Mantel's Theorem
- Probability and Computing
- On the Concentration of the Domination Number of the Random Graph
- Transversal factors and spanning trees
- The diameter of sparse random graphs
- On the domination number of a random graph
- Rainbow spanning structures in graph and hypergraph systems
This page was built for publication: Concentration of rainbow \(k\)-connectivity of a multiplex random graph
