Rainbow and monochromatic vertex-connection of random graphs
DOI10.1007/S10255-022-1027-2OpenAlexW4306774471MaRDI QIDQ2087672FDOQ2087672
Authors: Wenjing Li, Hui Jiang, Jia-bei He 
Publication date: 21 October 2022
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-022-1027-2
Recommendations
graph coloringrandom graphsthreshold functionrainbow vertex-connection numbermonochromatic vertex-connection number
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- On rainbow connection
- Rainbow connection number and connected dominating sets
- Graph theory with applications
- Rainbow connection in graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The Diameter of Random Graphs
- Hardness and algorithms for rainbow connection
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The complexity of determining the rainbow vertex-connection of a graph
- Rainbow connection in 3-connected graphs
- Rainbow connection of random regular graphs
- Threshold functions
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- On rainbow-\(k\)-connectivity of random graphs
- Spanning trees with many leaves
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Colorful monochromatic connectivity
- More on the colorful monochromatic connectivity
- The (vertex-)monochromatic index of a graph
- Extremal graphs with maximum monochromatic connectivity
- Properties of almost all graphs and complexes
- Hardness results for three kinds of colored connections of graphs
Cited In (1)
This page was built for publication: Rainbow and monochromatic vertex-connection of random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2087672)
