# Search results for: Xueliang Li

Bulletin of the Malaysian Mathematical Sciences Society > 2017 > 40 > 4 > 1769-1779

*monochromatically-connecting coloring*(MC-coloring, for short) if there is a monochromatic path joining any two vertices, which was introduced by Caro and Yuster. Let

*mc*(

*G*) denote the maximum number of colors used in an MC-coloring of a graph

*G*. Note that an MC-coloring does not exist if

*G*is not connected, in which case we simply let $$mc(G)=0$$ mc(G)=0...

Bulletin of the Malaysian Mathematical Sciences Society > 2015 > 38 > 3 > 1235-1241

Applied Mathematics and Computation > 2014 > 242 > Complete > 277-280

Theoretical Computer Science > 2011 > 412 > 35 > 4531-4535