On k-tuple domination of random graphs. - Bin Wang; Kai-Nan Xiang (Appl. Math. Lett., 2009)

A Note on Totally Free Matroids. - Rong Chen 002; Kai-Nan Xiang (Graphs Comb., 2009)

Amalgams of extremal matroids with no U2, l+2-minor. - Joseph E. Bonin; Rong Chen 002; Kai-Nan Xiang (Discret. Math., 2010)

Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. - Xingchao Deng; Kai-Nan Xiang; Baoyindureng Wu (Appl. Math. Lett., 2012)

Decomposition of 3-connected representable matroids. - Rong Chen 002; Kai-Nan Xiang (J. Comb. Theory B, 2012)

The largest component in critical random intersection graphs. - Bin Wang; Longmin Wang; Kai-Nan Xiang (Discuss. Math. Graph Theory, 2018)

An invariance principle and a large deviation principle for the biased random walk on ${ mathbb{Z}}^{ lowercase{ textbf{ textit{d}}}}$. - Yuelin Liu; Vladas Sidoravicius; Longmin Wang; Kai-Nan Xiang (J. Appl. Probab., 2020)