37 citations · 52 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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 and an in-branching wh…
math.CO2020
-tree connectivity of line graphs
Shasha Li
For a graph and a set of size at least , an -Steiner tree is a subgraph of that is a tree with . Two -Steiner trees $T…