2.2k citations
- Q. Ji3 profiles314 · h 58
- K. Liu3 profiles257 · h 7
- Y. Liu2 profiles257 · h 51
- Y. Lu2 profiles257 · h 58
- X. Li3 profiles239 · h 48
- C. Liu2 profiles235 · h 49
- H. Liu2 profiles231 · h 58
- Y. Fang212 · h 79
- C. Li2 profiles208 · h 80
- W. Wang2 profiles186 · h 41
- H. Li2 profiles179 · h 58
- U. Wiedner2 profiles179 · h 52
- Peking UniversityCN297 papers
- Tsinghua UniversityCN291 papers
- University of Science and Technology of ChinaCN284 papers
- Nanjing UniversityCN269 papers
- Shandong UniversityCN264 papers
- Shanghai Jiao Tong UniversityCN253 papers
- Sichuan UniversityCN251 papers
- University of Chinese Academy of SciencesCN245 papers
- Beihang UniversityCN244 papers
- Zhejiang UniversityCN242 papers
- Nanjing Normal UniversityCN239 papers
- Wuhan UniversityCN238 papers
Showing 2016 · math.COShow all
2 papers · 2 filters
math.CO2016★ 1 cited
Nordhaus-Gaddum-type theorem for total proper connection number of graphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is called a \emph{total-proper path}…
math.CO2016
3-Rainbow index and forbidden subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A tree in an edge-colored connected graph is called \emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset , a tree is ca…