# Search results for: Xueliang Li

Discussiones Mathematicae Graph Theory > 2017 > 37 > 1 > 141-154

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 3 > 1199-1209

*P*in an edge-colored graph

*G*is called a proper path if no two adjacent edges of

*P*are colored the same, and

*G*is proper connected if every two vertices of

*G*are connected by a proper path in

*G*. The proper connection number of a connected graph

*G*, denoted by $$\textit{pc}(G)$$ pc(G) , is the minimum number of colors that are needed to make

*G*proper connected. In this paper, we investigate the...

Theoretical Computer Science > 2015 > 607 > P3 > 480-487

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

Discrete Mathematics > 2012 > 312 > 8 > 1453-1457

Discrete Mathematics > 2005 > 297 > 1-3 > 128-143

Discrete Applied Mathematics > 2004 > 136 > 2-3 > 349-362

Electronic Notes in Discrete Mathematics > 2001 > 8 > Complete > 119-123