Rainbow connectivity and rainbow index of inhomogeneous random graphs
From MaRDI portal
Publication:6081106
DOI10.1016/j.ejc.2023.103778zbMath1525.05055MaRDI QIDQ6081106
Publication date: 25 October 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \((k,\ell)\)-rainbow index of random graphs
- Some remarks on rainbow connectivity
- On rainbow-\(k\)-connectivity of random graphs
- On rainbow connection
- Rainbow connections of graphs: a survey
- Rainbow connection of sparse random graphs
- A note on the majority dynamics in inhomogeneous random graphs
- Concentration of rainbow \(k\)-connectivity of a multiplex random graph
- Introduction to Random Graphs
- The rainbow connectivity of a graph
- Rainbow trees in graphs and generalized connectivity
- Rainbow connection in graphs
- Rainbow Connection of Random Regular Graphs
- The Diameter of Random Graphs
- Every monotone graph property has a sharp threshold
- The phase transition in inhomogeneous random graphs
- Hardness and Algorithms for Rainbow Connectivity
- On connectivity and robustness of random graphs with inhomogeneity
- On the threshold for rainbow connection number \(r\) in random graphs
This page was built for publication: Rainbow connectivity and rainbow index of inhomogeneous random graphs
