# Search results for: Xueliang Li

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 275-282

*k*-connectivity $$\kappa _k(G)$$ κ k ( G ) of a graph

*G*was introduced by Chartrand et al. in (Bull Bombay Math Colloq 2:1–6, 1984), which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of generalized edge-connectivity for a graph. In this paper, we consider the computational complexity of the...

Journal of Combinatorial Optimization > 2012 > 24 > 3 > 389-396

*G*be a nontrivial connected graph of order

*n*and let

*k*be an integer with 2≤

*k*≤

*n*. For a set

*S*of

*k*vertices of

*G*, let

*κ*(

*S*) denote the maximum number

*ℓ*of edge-disjoint trees

*T*

_{1},

*T*

_{2},…,

*T*

_{ ℓ }in

*G*such that

*V*(

*T*

_{ i })∩

*V*(

*T*

_{ j })=

*S*for every pair

*i*,

*j*of distinct integers with 1≤

*i*,

*j*≤

*ℓ*. Chartrand et al. generalized the concept of connectivity as follows: The

*k*-

*connectivity*, denoted by

*κ*

_{ k }(

*G*), of

*G*is...

Applied Mathematics Letters > 2009 > 22 > 3 > 320-324

Theoretical Computer Science > 2007 > 385 > 1-3 > 1-10

Journal of Combinatorial Optimization > 2006 > 11 > 4 > 445-454

*NP*-complete...

Journal of Combinatorial Optimization > 2005 > 9 > 4 > 331-347

*O*(

*n*

^{5}) combinatorial algorithm for the minimum weighted coloring problem on claw-free perfect graphs, which was posed by Hsu and Nemhauser in 1984. Our algorithm heavily relies on the structural descriptions of claw-free perfect graphs given by Chavátal and Sbihi and by Maffray and Reed.

Discussiones Mathematicae Graph Theory > 1997 > 17 > 2 > 259-269