18 citations · 176 across the 37 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 1 cited
Total coloring of 1-toroidal graphs of maximum degree at least 11 and no adjacent triangles
Tao Wang
A {\em total coloring} of a graph is an assignment of colors to the vertices and the edges of such that every pair of adjacent/incident elements receive distinct colors. Th…
math.CO2012★ 3 cited
On Murty-Simon Conjecture
Tao Wang
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter…