5 citations · 11 across the 7 of their papers we have counts for
Showing 2016 · math.COShow all
3 papers · 2 filters
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.CO2016★ 4 cited
More on 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.CO2016
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 path in a total-colored graph is a {\it total monochromatic path} if all the…