Minimally restricted edge connected graphs. - Yanmei Hong; Qinghai Liu; Zhao Zhang 002 (Appl. Math. Lett., 2008)

Minimally 3-restricted edge connected graphs. - Qinghai Liu; Yanmei Hong; Zhao Zhang 002 (Discret. Appl. Math., 2009)

Edges of degree k in minimally restricted k-edge connected graphs. - Yanmei Hong; Zhao Zhang 002; Qinghai Liu (Discret. Math., 2009)

Vertex fault tolerance of optimal-kappa graphs and super-kappa graphs. - Yanmei Hong; Zhao Zhang (Inf. Process. Lett., 2009)

Edge fault tolerance of graphs with respect to super edge connectivity. - Yanmei Hong; Jixiang Meng; Zhao Zhang 002 (Discret. Appl. Math., 2012)

Backup 2-center on interval graphs. - Yanmei Hong; Liying Kang (Theor. Comput. Sci., 2012)

Non-separating subgraphs. - Yanmei Hong; Hong-Jian Lai (Discret. Math., 2013)

Ore's condition for completely independent spanning trees. - Genghua Fan; Yanmei Hong; Qinghai Liu (Discret. Appl. Math., 2014)

Supereulerian digraphs. - Yanmei Hong; Hong-Jian Lai; Qinghai Liu (Discret. Math., 2014)

Nonseparating Cycles Avoiding Specific Vertices. - Yanmei Hong; Liying Kang; Xingxing Yu (J. Graph Theory, 2015)

Fractional spanning tree packing, forest covering and eigenvalues. - Yanmei Hong; Xiaofeng Gu 002; Hong-Jian Lai; Qinghai Liu (Discret. Appl. Math., 2016)

Ore-type degree condition of supereulerian digraphs. - Yanmei Hong; Qinghai Liu; Hong-Jian Lai (Discret. Math., 2016)

Characterization of Digraphic Sequences with Strongly Connected Realizations. - Yanmei Hong; Qinghai Liu; Hong-Jian Lai (J. Graph Theory, 2017)

The reliability of lexicographic product digraphs. - Qinghai Liu; Yanmei Hong (Appl. Math. Comput., 2019)

Edge decomposition of connected claw-free cubic graphs. - Yanmei Hong; Qinghai Liu; Nannan Yu (Discret. Appl. Math., 2020)

Connectivity keeping caterpillars and spiders in 2-connected graphs. - Yanmei Hong; Qinghai Liu; Changhong Lu; Qingjie Ye (Discret. Math., 2021)

Mader's conjecture for graphs with small connectivity. - Yanmei Hong; Qinghai Liu (J. Graph Theory, 2022)

Connectivity keeping trees in 3-connected or 3-edge-connected graphs. - Haiyang Liu; Qinghai Liu; Yanmei Hong (Discret. Math., 2023)

Gallai's conjecture for 3-degenerated graphs. - Junhao Zhang; Qinghai Liu; Yanmei Hong (Discret. Math., 2024)

Highly connected triples and Mader's conjecture. - Qinghai Liu; Kai Ying; Yanmei Hong (J. Graph Theory, 2024)