Shasha Li

activity

20102020

most citedThe generalized connectivity of complete bipartite graphs

37 citations · 52 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2020

The smallest number of vertices in a 2-arc-strong digraph which has no good pair

Ran Gu, Gregory Gutin, Shasha Li +2

Bang-Jensen, Bessy, Havet and Yeo showed that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching $B^{+}$ and an in-branching $B^{-}$ wh…

math.CO2020

$k$ -tree connectivity of line graphs

Shasha Li

For a graph $G = (V, E)$ and a set $S \subseteq V (G)$ of size at least $2$ , an $S$ -Steiner tree $T$ is a subgraph of $G$ that is a tree with $S \subseteq V (T)$ . Two $S$ -Steiner trees $T…

math.CO2017

On the complexity of k-rainbow cycle colouring problems

Shasha Li, Yongtang Shi, Jianhua Tu +1

An edge-coloured cycle is $r ainb o w$ if all edges of the cycle have distinct colours. For $k \geq 1$ , let $F_{k}$ denote the family of all graphs with the property that any…

math.CO2011

Note on the minimal size of a graph with generalized connectivity kappa_3= 2

Shasha Li, Xueliang Li, Yongtang Shi

The concept of generalized $k$ -connectivity $κ_{k} (G)$ of a graph $G$ was introduced by Chartrand et al. in recent years. In our early paper, extremal theory for this graph paramet…

math.CO2011★ 14 cited

The minimal size of a graph with generalized connectivity $κ_{3} = 2$

Shasha Li, Xueliang Li, Yongtang Shi

Let $G$ be a nontrivial connected graph of order $n$ and $k$ an integer with $2 \leq k \leq n$ . For a set $S$ of $k$ vertices of $G$ , let $κ (S)$ denote the maximum number $ℓ$ of e…

math.CO2010★ 37 cited

The generalized connectivity of complete bipartite graphs

Shasha Li, Wei Li, Xueliang Li

Let $G$ be a nontrivial connected graph of order $n$ , and $k$ an integer with $2 \leq k \leq n$ . For a set $S$ of $k$ vertices of $G$ , let $κ (S)$ denote the maximum number $ℓ$ of…