Hamiltonian paths and hamiltonian connectivity in graphs. - Bing Wei 001 (Discret. Math., 1993)

A generalization of a result of Bauer and Schmeichel. - Bing Wei 001 (Graphs Comb., 1993)

Hamiltonian cycles in 1-tough graphs. - Bing Wei 001 (Graphs Comb., 1996)

Hamiltonicity of k-connected graphs with independent claws. - Ruqun Shen; Feng Tian 008; Bing Wei 001 (Ars Comb., 1997)

Hamiltonicity of 2-connected claw-center independent graphs. - Hao Li 002; Mei Lu; Feng Tian 008; Bing Wei 001 (Discret. Math., 1997)

Hamiltonian κ-factors in graphs. - Bing Wei 001; Yongjin Zhu (J. Graph Theory, 1997)

Some new localization theorems on Hamiltonian properties. - Feng Tian 008; Bing Wei 001 (Australas. J Comb., 1998)

Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2. - Feng Tian 008; Bing Wei 001; Lei Zhang 030 (Discret. Appl. Math., 1999)

Some properties of 3-domination-critical graphs. - Evelyne Flandrin; Feng Tian 008; Bing Wei 001; Lei Zhang 030 (Discret. Math., 1999)

Panconnectivity of locally connected claw-free graphs. - Yu Sheng; Feng Tian 008; Bing Wei 001 (Discret. Math., 1999)

On the Circumferences of Regular 2-Connected Graphs. - Bing Wei 001 (J. Comb. Theory B, 1999)

A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs. - Bing Wei 001 (J. Comb. Theory B, 1999)

Degree Sequences with Repeated Values. - Guantao Chen; Joan P. Hutchinson; Wiktor Piotrowski; Warren E. Shreve; Bing Wei 001 (Ars Comb., 2001)

A degree condition of 2-factors in bipartite graphs. - Xiangwen Li; Bing Wei 001; Fan Yang 074 (Discret. Appl. Math., 2001)

Degree Sums and Path-Factors in Graphs. - Yaojun Chen; Feng Tian 008; Bing Wei 001 (Graphs Comb., 2001)

Degree-Light-Free Graphs and Hamiltonian Cycles. - Guantao Chen; Bing Wei 001; Xuerong Zhang (Graphs Comb., 2001)

Degree Sums, Connectivity and Dominating Cycles in Graphs. - Zhiren Sun; Feng Tian 008; Bing Wei 001 (Graphs Comb., 2001)

Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. - Zhiren Sun; Feng Tian 008; Bing Wei 001 (Graphs Comb., 2001)

Long Cycles through a Linear Forest. - Zhiquan Hu; Feng Tian 008; Bing Wei 001 (J. Comb. Theory B, 2001)

The hamiltonicity of bipartite graphs involving neighborhood unions. - Guantao Chen; Akira Saito; Bing Wei 001; Xuerong Zhang (Discret. Math., 2002)

Hamilton cycles in 1-tough triangle-free graphs. - Xiangwen Li; Bing Wei 001; Zhengguang Yu; Yongjin Zhu (Discret. Math., 2002)

The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs. - Bing Wei 001; Yongjin Zhu (Discret. Math., 2002)

Codiameters of 3-connected 3-domination critical graphs. - Yaojun Chen; Feng Tian 008; Bing Wei 001 (J. Graph Theory, 2002)

Fan-type theorem for path-connectivity. - Zhiquan Hu; Feng Tian 008; Bing Wei 001; Yoshimi Egawa; Kazuhide Hirohata (J. Graph Theory, 2002)

Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta. - Yaojun Chen; Feng Tian 008; Bing Wei 001 (Discret. Math., 2003)

On Ranks of Matrices Associated with Trees. - Guantao Chen; Frank J. Hall; Zhongshan Li; Bing Wei 001 (Graphs Comb., 2003)

Extremal graphs for intersecting cliques. - Guantao Chen; Ronald J. Gould; Florian Pfender; Bing Wei 001 (J. Comb. Theory B, 2003)

Independent Cycles in a Bipartite Graph. - Xiangwen Li; Bing Wei 001; Fan Yang 074 (Ars Comb., 2004)

Long cycles in triangle-free graphs with prescribed independence number and connectivity. - Hikoe Enomoto; Atsushi Kaneko; Akira Saito; Bing Wei 001 (J. Comb. Theory B, 2004)

Some remarks on domination. - Dan Archdeacon; Joanna A. Ellis-Monaghan; David C. Fisher; Dalibor Froncek; Peter Che Bor Lam; Suzanne M. Seager; Bing Wei 001; Raphael Yuster (J. Graph Theory, 2004)

Largest circuits in matroids. - Nolan McMurray; Talmage James Reid; Bing Wei 001; Haidong Wu (Adv. Appl. Math., 2005)

Graph minors and linkages. - Guantao Chen; Ronald J. Gould; Ken-ichi Kawarabayashi; Florian Pfender; Bing Wei 001 (J. Graph Theory, 2005)

Hamilton connectivity of line graphs and claw-free graphs. - Zhiquan Hu; Feng Tian 008; Bing Wei 001 (J. Graph Theory, 2005)

Path extendability of claw-free graphs. - Yu Sheng; Feng Tian 008; Jianglu Wang; Bing Wei 001; Yongjin Zhu (Discret. Math., 2006)

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. - Zemin Jin; Mikio Kano; Xueliang Li 001; Bing Wei 001 (J. Comb. Optim., 2006)

Hamiltonian graphs involving neighborhood unions. - Guantao Chen; Warren E. Shreve; Bing Wei 001 (J. Graph Theory, 2006)

On deletions of largest bonds in graphs. - Nolan McMurray; Talmage James Reid; Laura Sheppardson; Bing Wei 001; Haidong Wu (Discret. Math., 2008)

Long cycles containing k-ordered vertices in graphs. - Emlee W. Nicholson; Bing Wei 001 (Discret. Math., 2008)

A sufficient condition for pancyclability of graphs. - Evelyne Flandrin; Hao Li 002; Bing Wei 001 (Discret. Math., 2009)

Independence polynomials of k-tree related graphs. - Lanzhen Song; William Staton; Bing Wei 001 (Discret. Appl. Math., 2010)

Some properties of k-trees. - James M. Shook; Bing Wei 001 (Discret. Math., 2010)

Cycles in Triangle-Free Graphs. - Xiaojuan Li; Bing Wei 001; Yongjin Zhu (Discret. Math. Algorithms Appl., 2011)

Sharp bounds for Zagreb indices of maximal outerplanar graphs. - Ailin Hou; Shuchao Li; Lanzhen Song; Bing Wei 001 (J. Comb. Optim., 2011)

Independence polynomials of some compound graphs. - Lanzhen Song; William Staton; Bing Wei 001 (Discret. Appl. Math., 2012)

A bound on the values of independence polynomials at -1/k-1/k for kk-degenerate graphs. - John W. Estes; William Staton; Bing Wei 001 (Discret. Math., 2013)

Long Paths containing k-ordered vertices in Graphs. - Emlee W. Nicholson; Bing Wei 001 (Ars Comb., 2014)

Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees. - Xuechao Li; Bing Wei 001 (Discret. Math., 2014)

Sharp bounds of the Zagreb indices of k-trees. - John W. Estes; Bing Wei 001 (J. Comb. Optim., 2014)

Multiplicative Zagreb indices of k-trees. - Shaohui Wang; Bing Wei 001 (Discret. Appl. Math., 2015)

Degree Sum Condition for k-ordered Hamiltonian Connected Graphs. - Emlee W. Nicholson; Bing Wei 001 (Graphs Comb., 2015)

Multiplicative Zagreb indices of cacti. - Shaohui Wang; Bing Wei 001 (Discret. Math. Algorithms Appl., 2016)

Degree conditions for weakly geodesic pancyclic graphs and their exceptions. - Emlee W. Nicholson; Bing Wei 001 (J. Comb. Optim., 2016)

Independent bondage number of a graph. - Bruce Priddy; Haiying Wang 002; Bing Wei 001 (J. Comb. Optim., 2019)

A note on Gallai-Ramsey number of even wheels. - Zi-Xia Song; Bing Wei 001; Fangfang Zhang; Qinghong Zhao (Discret. Math., 2020)

Gallai-Ramsey numbers for graphs with chromatic number three. - Qinghong Zhao; Bing Wei 001 (Discret. Appl. Math., 2021)

Long cycles through specified vertices. - Shuchao Li; Xuechao Li; Bing Wei 001 (Discret. Math., 2021)

Gallai-Ramsey numbers for graphs with five vertices and chromatic number four. - Qinghong Zhao; Bing Wei 001 (Australas. J Comb., 2022)

Independent bondage number of planar graphs with minimum degree at least 3. - Andrew Pham; Bing Wei 001 (Discret. Math., 2022)

Bonds Intersecting Long Paths in (k ) -Connected Graphs. - Qinghong Zhao; Bing Wei 001; Haidong Wu (SIAM J. Discret. Math., 2023)