2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Connectivity keeping pendant extensions of paths in -connected triangle-free graphs
Menghan Ma, Qinghai Liu, Liping Zhang +1
Motivated by Mader's conjecture on connectivity keeping trees, we study the corresponding problem in triangle-free graphs. For positive integers , we first prove that every $k…
Connectivity keeping pendant extensions of paths in -connected graphs and triangle-free graphs
Menghan Ma, Qinghai Liu, Liping Zhang +1
Motivated by Mader's conjecture on connectivity keeping trees, we study trees obtained from paths by adding one pendant vertex, as well as related problems in triangle-free graphs.…
The Bounded-VC chromatic thresholds of graphs
Jinze Hu, Qinghai Liu, Liping Zhang +1
For a graph , the chromatic threshold is the infimum of such that the chromatic number of every -vertex -free graph with minimum degree at least is bou…
Mader's conjecture for graphs with small connectivity
Yanmei Hong, Qinghai Liu
Mader conjectured that for any tree of order , every -connected graph with minimum degree at least contains a subtree su…
Rooted Spider Embeddings and the Erd\H os-Sós Conjecture
Genghua Fan, Yanmei Hong, Qinghai Liu
Under a local density condition, we prove that every -edge spider embeds at any prescribed center of degree at least , unless all legs are even and the host graph has one of…