# A Survey on Monochromatic Connections of Graphs

**Authors:** Xueliang Li, Di Wu

arXiv: 1706.03879 · 2017-06-14

## TL;DR

This survey comprehensively reviews the development and various results related to monochromatic connection in graphs, covering multiple coloring versions and indices since its introduction in 2011.

## Contribution

It consolidates and classifies existing research on monochromatic connection of graphs, providing a unified overview of the field.

## Key findings

- Summarizes key results in edge- and vertex-version coloring
- Highlights developments in monochromatic connection indices
- Organizes results into clear categories for future reference

## Abstract

The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recently, a lot of results have been published about it. In this survey, we attempt to bring together all the results that dealt with it. We begin with an introduction, and then classify the results into the following categories: monochromatic connection coloring of edge-version, monochromatic connection coloring of vertex-version, monochromatic index, monochromatic connection coloring of total-version.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1706.03879/full.md

## Figures

3 figures with captions in the complete paper: https://tomesphere.com/paper/1706.03879/full.md

## References

24 references — full list in the complete paper: https://tomesphere.com/paper/1706.03879/full.md

---
Source: https://tomesphere.com/paper/1706.03879