Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
From MaRDI portal
Publication:512870
DOI10.1007/s10878-015-9938-yzbMath1358.05097arXiv1412.7798OpenAlexW2062733831MaRDI QIDQ512870
Qingqiong Cai, Di Wu, Xue Liang Li
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.7798
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (14)
Total monochromatic connection of graphs ⋮ Monochromatic disconnection: Erdős-Gallai-type problems and product graphs ⋮ The monochromatic connectivity of graphs ⋮ More on the colorful monochromatic connectivity ⋮ Erdös-Gallai-type problems for distance-edge-monitoring numbers ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Multicolorful connectivity of trees ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ The (vertex-)monochromatic index of a graph ⋮ Monochromatic \(k\)-edge-connection colorings of graphs ⋮ Monochromatic connectivity and graph products ⋮ Rainbow monochromatic \(k\)-edge-connection colorings of graphs ⋮ Erdős-Gallai-type results for total monochromatic connection of graphs ⋮ Extremal graphs with maximum monochromatic connectivity
Cites Work
- Unnamed Item
- A note on the minimum size of \(k\)-rainbow-connected graphs
- Note on minimally \(d\)-rainbow connected graphs
- On rainbow connection
- Rainbow connections of graphs: a survey
- On minimally rainbow \(k\)-connected graphs
- Colorful monochromatic connectivity
- Rainbow connection number of dense graphs
- Graphs with rainbow connection number two
- Rainbow connection in graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
This page was built for publication: Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
