Showing math.COShow all
2 papers · 1 filter
math.CO2016
Erdős-Gallai-type results for total monochromatic connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting color…
math.CO2015
Good upper bounds for the total rainbow connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A total-colored graph is a graph such that both all edges and all vertices of are colored. A path in a total-colored graph is a total rainbow path if its edges and inte…