# Search results for: Xueliang Li

Journal of Combinatorial Optimization > 2017 > 34 > 1 > 165-173

*G*, the smallest number of colors that are needed in order to make

*G*proper connected is called the proper connection number of...

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 > 2016 > 609 > P2 > 336-343

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