Total monochromatic connection of graphs
From MaRDI portal
Publication:2374173
DOI10.1016/j.disc.2016.08.020zbMath1351.05079arXiv1601.03241MaRDI QIDQ2374173
Hui Jiang, Yingying Zhang, Xue Liang Li
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.03241
05C15: Coloring of graphs and hypergraphs
Related Items
Further results on the total monochromatic connectivity of graphs, Monochromatic \(k\)-edge-connection colorings of graphs, Erdős-Gallai-type results for total monochromatic connection of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total rainbow \(k\)-connection in graphs
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
- More on the colorful monochromatic connectivity
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Rainbow connections of graphs: a survey
- Colorful monochromatic connectivity
- Rainbow vertex \(k\)-connection in graphs
- Properties of almost all graphs and complexes