- Tytuł:
- Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
- Autorzy:
-
Jiang, Hui
Li, Xueliang
Zhang, Yingying - Powiązania:
- https://bibliotekanauki.pl/articles/31343240.pdf
- Data publikacji:
- 2019-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
total-colored graph
total monochromatic connection
Erdős- Gallai-type problem - Opis:
- 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 same color. For a connected graph G, the total monochromatic connection number, denoted by tmc(G), is defined as the maximum number of colors used in a TMC-coloring of G. In this paper, we study two kinds of Erdős-Gallai-type problems for tmc(G) and completely solve them.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 4; 775-785
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł