Multicolorful connectivity of trees

DOI10.1016/J.AMC.2021.126147OpenAlexW3136291065MaRDI QIDQ2242784

Kaijun Wang, Xueyao Gui, Ze-min Jin

Publication date: 10 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126147

zbMATH Keywords

treeconnectivitycoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Proper connection of graphs
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• Extremal graphs with maximum monochromatic connectivity
• On rainbow connection
• More on the colorful monochromatic connectivity
• Rainbow connections of graphs: a survey
• Colorful monochromatic connectivity
• The monochromatic connectivity of graphs
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Hardness and Algorithms for Rainbow Connectivity

This page was built for publication: Multicolorful connectivity of trees