Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a path whose edges and internal vertices have the s...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2019-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2095 |