Yanmei Hong

Discret. Math., December, 2023

2022

Mader's conjecture for graphs with small connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

2021

Connectivity keeping caterpillars and spiders in 2-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Edge decomposition of connected claw-free cubic graphs.

[BibT_eX]

[DOI]

Nannan Yu

Discret. Appl. Math., 2020

2019

The reliability of lexicographic product digraphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2017

Characterization of Digraphic Sequences with Strongly Connected Realizations.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

2016

Ore-type degree condition of supereulerian digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Fractional spanning tree packing, forest covering and eigenvalues.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Nonseparating Cycles Avoiding Specific Vertices.

[BibT_eX]

[DOI]

Liying Kang

Xingxing Yu

J. Graph Theory, 2015

2014

Supereulerian digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Ore's condition for completely independent spanning trees.

[BibT_eX]

[DOI]

Genghua Fan

Discret. Appl. Math., 2014

2013

Non-separating subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

2012

Backup 2-center on interval graphs.

[BibT_eX]

[DOI]

Liying Kang

Theor. Comput. Sci., 2012

Edge fault tolerance of graphs with respect to super edge connectivity.

[BibT_eX]

[DOI]

Jixiang Meng

Discret. Appl. Math., 2012

2009

Vertex fault tolerance of optimal-kappa graphs and super-kappa graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Edges of degree k in minimally restricted k-edge connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Minimally 3-restricted edge connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Minimally restricted edge connected graphs.

[BibT_eX]

[DOI]