# Search results for: Xueliang Li

Bulletin of the Malaysian Mathematical Sciences Society > 2019 > 42 > 5 > 2105-2117

*total-coloring*of a graph is a coloring of the edge set and vertex set. A path in a total-colored graph is a

*total proper path*if the coloring of the edges and internal vertices is proper, that is, any two adjacent or incident elements of edges and internal vertices on the path differ in color. For a connected graph

*G*, the

*total proper connection number*of

*G*, denoted by

*tpc*(

*G*), is defined as the...

Journal of Combinatorial Optimization > 2016 > 32 > 1 > 260-266

*total-colored graph*is a graph such that both all edges and all vertices of the graph are colored. A path in a total-colored graph is a

*total rainbow path*if its edges and internal vertices have distinct colors. A total-colored graph is

*total-rainbow connected*if any two vertices of the graph are connected by a total-rainbow path of the graph. For a connected graph $$G$$ G , the

*total rainbow connection number*...

Discussiones Mathematicae Graph Theory > 2013 > 33 > 2 > 307-313

Discrete Mathematics > 2010 > 310 > 17-18 > 2448-2451

European Journal of Operational Research > 2010 > 200 > 1 > 9-13