Feng Tian

According to our database, Feng Tian authored at least 37 papers between 1985 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

An improved upper bound for the Laplacian spectral radius of graphs.

Mei Lu, Huiqing Liu, Feng Tian

Discret. Math., 2009

2007

Laplacian spectral bounds for clique and independence numbers of graphs.

Mei Lu, Huiqing Liu, Feng Tian

J. Comb. Theory B, 2007

Relative Length of Longest Paths and Cycles in Graphs.

Huiqing Liu, Mei Lu, Feng Tian

Graphs Comb., 2007

2006

Path extendability of claw-free graphs.

Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu

Discret. Math., 2006

Trees of extremal connectivity index.

Huiqing Liu, Mei Lu, Feng Tian

Discret. Appl. Math., 2006

Unicyclic graphs with exactly two main eigenvalues.

Yaoping Hou, Feng Tian

Appl. Math. Lett., 2006

2005

Two sufficient conditions for dominating cycles.

Mei Lu, Huiqing Liu, Feng Tian

J. Graph Theory, 2005

Hamilton connectivity of line graphs and claw-free graphs.

Zhiquan Hu, Feng Tian, Bing Wei

J. Graph Theory, 2005

Fan-Type Theorem for Long Cycles Containing a Specified Edge.

Mei Lu, Huiqing Liu, Feng Tian

Graphs Comb., 2005

Condorcet Winners for Public Goods.

Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian

Ann. Oper. Res., 2005

2004

A short proof of Fan's theorem.

Feng Tian

Discret. Math., 2004

2003

Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta.

Yaojun Chen, Feng Tian, Bing Wei

Discret. Math., 2003

A New Proof of Wojcicka's Conjecture.

Yaojun Chen, Feng Tian

Discret. Appl. Math., 2003

Majority Equilibrium for Public Facility Allocation (Preliminary Version).

Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Fan-type theorem for path-connectivity.

Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata

J. Graph Theory, 2002

Codiameters of 3-connected 3-domination critical graphs.

Yaojun Chen, Feng Tian, Bing Wei

J. Graph Theory, 2002

Hamilton-connectivity of 3-Domination Critical Graphs with alpha=delta + 2.

Yaojun Chen, Feng Tian, Yunqing Zhang

Eur. J. Comb., 2002

2001

Long Cycles through a Linear Forest.

Zhiquan Hu, Feng Tian, Bing Wei

J. Comb. Theory B, 2001

Long Cycles Passing Through a Specified Edge in 3-Connected Graphs.

Zhiren Sun, Feng Tian, Bing Wei

Graphs Comb., 2001

Degree Sums, Connectivity and Dominating Cycles in Graphs.

Zhiren Sun, Feng Tian, Bing Wei

Graphs Comb., 2001

Degree Sums and Path-Factors in Graphs.

Yaojun Chen, Feng Tian, Bing Wei

Graphs Comb., 2001

Cycles Containing Given Subsets in 1-Tough Graphs.

Jianping Li, Ruqun Shen, Feng Tian

Ars Comb., 2001

2000

Cyclability of 3-connected graphs.

Amel Harkat-Benhamdine, Hao Li, Feng Tian

J. Graph Theory, 2000

1999

Panconnectivity of locally connected claw-free graphs.

Yu Sheng, Feng Tian, Bing Wei

Discret. Math., 1999

Some properties of 3-domination-critical graphs.

Evelyne Flandrin, Feng Tian, Bing Wei, Lei Zhang

Discret. Math., 1999

An Ore-type condition for pancyclability.

Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian

Discret. Math., 1999

Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2.

Feng Tian, Bing Wei, Lei Zhang

Discret. Appl. Math., 1999

1998

Some new localization theorems on Hamiltonian properties.

Feng Tian, Bing Wei

Australas. J Comb., 1998

1997

Independence and hamiltonicity in 3-domination-critical graphs.

Odile Favaron, Feng Tian, Lei Zhang

J. Graph Theory, 1997

Long dominating cycles in graphs.

Ruqun Shen, Feng Tian

Discret. Math., 1997

Hamiltonicity of 2-connected claw-center independent graphs.

Hao Li, Mei Lu, Feng Tian, Bing Wei

Discret. Math., 1997

Cycles through subsets with large degree sums.

Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman

Discret. Math., 1997

Hamiltonicity of k-connected graphs with independent claws.

Ruqun Shen, Feng Tian, Bing Wei

Ars Comb., 1997

1996

Sequences, claws and cyclability of graphs.

Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu

J. Graph Theory, 1996

1995

Neighborhood unions and hamiltonicity of graphs.

Ruqun Shen, Feng Tian

Discret. Math., 1995

1991

More powerful closure operations on graphs.

Yongjin Zhu, Feng Tian, Xiaotie Deng

Discret. Math., 1991

1985

Smallest regular graphs with girth pair (4, 2<i>t</i>+1).

Feng Tian, Xiaotie Deng, Ronghua Shi

Graphs Comb., 1985