Smallest regular graphs with girth pair (4, 2t+1). - Feng Tian 008; Xiaotie Deng; Ronghua Shi (Graphs Comb., 1985)

More powerful closure operations on graphs. - Yongjin Zhu; Feng Tian 008; Xiaotie Deng (Discret. Math., 1991)

Neighborhood unions and hamiltonicity of graphs. - Ruqun Shen; Feng Tian 008 (Discret. Math., 1995)

Sequences, claws and cyclability of graphs. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Yiping Liu; Feng Tian 008; Zhengsheng Wu (J. Graph Theory, 1996)

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

Cycles through subsets with large degree sums. - Hajo Broersma; Hao Li 002; Jianping Li 007; Feng Tian 008; Henk Jan Veldman (Discret. Math., 1997)

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

Long dominating cycles in graphs. - Ruqun Shen; Feng Tian 008 (Discret. Math., 1997)

Independence and hamiltonicity in 3-domination-critical graphs. - Odile Favaron; Feng Tian 008; Lei Zhang 030 (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)

An Ore-type condition for pancyclability. - Odile Favaron; Evelyne Flandrin; Hao Li 002; Feng Tian 008 (Discret. 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)

Cyclability of 3-connected graphs. - Amel Harkat-Benhamdine; Hao Li 002; Feng Tian 008 (J. Graph Theory, 2000)

Cycles Containing Given Subsets in 1-Tough Graphs. - Jianping Li 007; Ruqun Shen; Feng Tian 008 (Ars Comb., 2001)

Degree Sums and Path-Factors in Graphs. - Yaojun Chen; Feng Tian 008; Bing Wei 001 (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)

Hamilton-connectivity of 3-Domination Critical Graphs with alpha=delta + 2. - Yaojun Chen; Feng Tian 008; Yunqing Zhang (Eur. J. Comb., 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)

Majority Equilibrium for Public Facility Allocation (Preliminary Version). - Lihua Chen; Xiaotie Deng; Qizhi Fang; Feng Tian 008 (COCOON, 2003)

A New Proof of Wojcicka's Conjecture. - Yaojun Chen; Feng Tian 008 (Discret. Appl. Math., 2003)

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

A short proof of Fan's theorem. - Feng Tian 008 (Discret. Math., 2004)

Condorcet Winners for Public Goods. - Lihua Chen; Xiaotie Deng; Qizhi Fang; Feng Tian 008 (Ann. Oper. Res., 2005)

Fan-Type Theorem for Long Cycles Containing a Specified Edge. - Mei Lu; Huiqing Liu; Feng Tian 008 (Graphs Comb., 2005)

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

Two sufficient conditions for dominating cycles. - Mei Lu; Huiqing Liu; Feng Tian 008 (J. Graph Theory, 2005)

Unicyclic graphs with exactly two main eigenvalues. - Yaoping Hou; Feng Tian 008 (Appl. Math. Lett., 2006)

Trees of extremal connectivity index. - Huiqing Liu; Mei Lu; Feng Tian 008 (Discret. Appl. Math., 2006)

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

Relative Length of Longest Paths and Cycles in Graphs. - Huiqing Liu; Mei Lu; Feng Tian 008 (Graphs Comb., 2007)

Laplacian spectral bounds for clique and independence numbers of graphs. - Mei Lu; Huiqing Liu; Feng Tian 008 (J. Comb. Theory B, 2007)

An improved upper bound for the Laplacian spectral radius of graphs. - Mei Lu; Huiqing Liu; Feng Tian 008 (Discret. Math., 2009)