3 citations · 4 across the 4 of their papers we have counts for
4 papers
A constructive characterization of uniformly 4-connected graphs
Xiang Chen, Shuai Kou, Chengfu Qin +2
A constructive characterization of the class of uniformly -connected graphs is presented. The characterization is based on the application of graph operations to appropriate ver…
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu +1
Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer and every finite tree with order , every -connected, finite graph with $δ(G)\g…
Connectivity keeping stars or double-stars in 2-connected graphs
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai +1
In [W. Mader, Connectivity keeping paths in -connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer and every finite tree …
The maximum forcing number of polyomino
Liqiong Xu, Yuqing Lin, Fuji Zhang
The forcing number of a perfect matching of a graph is the cardinality of the smallest subset of that is contained in no other perfect matchings of . For a planar em…