Rainbow and monochromatic vertex-connection of random graphs

DOI10.1007/S10255-022-1027-2MaRDI QIDQ2087672zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph coloringrandom graphsthreshold functionrainbow vertex-connection numbermonochromatic vertex-connection number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Sharp concentration of the rainbow connection of random graphs
• Rainbow vertex connection number of dense and sparse graphs.
• Rainbow vertex \(k\)-connection in graphs
• Rainbow \(k\)-connection in dense graphs
• Rainbow vertex-connection and forbidden subgraphs

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Colorful monochromatic connectivity
• Extremal graphs with maximum monochromatic connectivity
• Graph theory with applications
• Hardness and algorithms for rainbow connection
• Hardness results for three kinds of colored connections of graphs
• More on the colorful monochromatic connectivity
• On rainbow connection
• On rainbow-k-connectivity of random graphs
• Properties of almost all graphs and complexes
• Rainbow connection in 3-connected graphs
• Rainbow connection in graphs
• Rainbow connection number and connected dominating sets
• Rainbow connection of random regular graphs
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• Spanning trees with many leaves
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• The (vertex-)monochromatic index of a graph
• The Diameter of Random Graphs
• The complexity of determining the rainbow vertex-connection of a graph
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Threshold functions

Cited in

(1)

• Monochromatic vertex-disconnection colorings of graphs

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)