Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFeng Tian 0008
Person information
- affiliation: Chinese Academy of Sciences, Institute of Systems Science, Beijing, China
Other persons with the same name
- Feng Tian — disambiguation page
- Feng Tian 0001
![[0000-0002-6598-419X]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6598-419X")
— Chinese Academy of Sciences, Institute of Software, Beijing, China - Feng Tian 0002 — Xi'an Jiaotong University, Department of Automation Science and Technology, China
- Feng Tian 0003 — Lund University, Department of Physical Geography and Ecosystem Science, Sweden (and 2 more)
- Feng Tian 0004 — Shaanxi Normal University, College of Computer Science, Xi'an, China (and 1 more)
- Feng Tian 0005 — Peking University, State Key Laboratory of Protein and Plant Gene Research, Beijing, China (and 2 more)
- Feng Tian 0006 — Bournemouth University, School of Design, Engineering & Computing, UK (and 1 more)
- Feng Tian 0007 — Nanjing University of Posts and Telecommunications, Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, China (and 2 more)
- Feng Tian 0009 — Northeast Petroleum University, School of Computer and Information Technology, Daqing, China (and 1 more)
- Feng Tian 0010 — China University of Mining and Technology, School of Mechatronic Engineering, Xuzhou, China
- Feng Tian 0011 — Hong Kong Polytechnic University, School of Accounting and Finance, Hong Kong (and 1 more)
- Feng Tian 0012 — University of Michigan, Ann Arbor, MI, USA
- Feng Tian 0013 — Hampton University, Department of Mathematics, VA, USA (and 1 more)
- Feng Tian 0014 — Chinese Academy of Sciences, Shanghai Engineering Center for Microsatellites, China (and 1 more)
- Feng Tian 0015 — Beijing University of Posts and Telecommunications, State Key Laboratory of Information Photonics and Optical Communications, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j36]Mei Lu, Huiqing Liu, Feng Tian:
An improved upper bound for the Laplacian spectral radius of graphs. Discret. Math. 309(21): 6318-6321 (2009)- 2007
- [j35]Huiqing Liu, Mei Lu, Feng Tian:
Relative Length of Longest Paths and Cycles in Graphs. Graphs Comb. 23(4): 433-443 (2007) - [j34]Mei Lu, Huiqing Liu, Feng Tian:
Laplacian spectral bounds for clique and independence numbers of graphs. J. Comb. Theory, Ser. B 97(5): 726-732 (2007) - 2006
- [j33]Yaoping Hou, Feng Tian:
Unicyclic graphs with exactly two main eigenvalues. Appl. Math. Lett. 19(11): 1143-1147 (2006) - [j32]Huiqing Liu, Mei Lu, Feng Tian:
Trees of extremal connectivity index. Discret. Appl. Math. 154(1): 106-119 (2006) - [j31]Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu:
Path extendability of claw-free graphs. Discret. Math. 306(16): 2010-2015 (2006) - 2005
- [j30]Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian:
Condorcet Winners for Public Goods. Ann. Oper. Res. 137(1): 229-242 (2005) - [j29]Mei Lu, Huiqing Liu, Feng Tian:
Fan-Type Theorem for Long Cycles Containing a Specified Edge. Graphs Comb. 21(4): 489-501 (2005) - [j28]Mei Lu, Huiqing Liu, Feng Tian:
Two sufficient conditions for dominating cycles. J. Graph Theory 49(2): 135-150 (2005) - [j27]Zhiquan Hu, Feng Tian, Bing Wei:
Hamilton connectivity of line graphs and claw-free graphs. J. Graph Theory 50(2): 130-141 (2005) - 2004
- [j26]Feng Tian:
A short proof of Fan's theorem. Discret. Math. 286(3): 285-286 (2004) - 2003
- [j25]Yaojun Chen, Feng Tian:
A New Proof of Wojcicka's Conjecture. Discret. Appl. Math. 127(3): 545-554 (2003) - [j24]Yaojun Chen, Feng Tian, Bing Wei:
Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta. Discret. Math. 271(1-3): 1-12 (2003) - 2002
- [j23]Yaojun Chen, Feng Tian, Yunqing Zhang:
Hamilton-connectivity of 3-Domination Critical Graphs with alpha=delta + 2. Eur. J. Comb. 23(7): 777-784 (2002) - [j22]Yaojun Chen, Feng Tian, Bing Wei:
Codiameters of 3-connected 3-domination critical graphs. J. Graph Theory 39(1): 76-85 (2002) - [j21]Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata:
Fan-type theorem for path-connectivity. J. Graph Theory 39(4): 265-282 (2002) - 2001
- [j20]Jianping Li, Ruqun Shen, Feng Tian:
Cycles Containing Given Subsets in 1-Tough Graphs. Ars Comb. 58 (2001) - [j19]Yaojun Chen, Feng Tian, Bing Wei:
Degree Sums and Path-Factors in Graphs. Graphs Comb. 17(1): 61-71 (2001) - [j18]Zhiren Sun, Feng Tian, Bing Wei:
Degree Sums, Connectivity and Dominating Cycles in Graphs. Graphs Comb. 17(3): 555-564 (2001) - [j17]Zhiren Sun, Feng Tian, Bing Wei:
Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. Graphs Comb. 17(3): 565-577 (2001) - [j16]Zhiquan Hu, Feng Tian, Bing Wei:
Long Cycles through a Linear Forest. J. Comb. Theory, Ser. B 82(1): 67-80 (2001) - 2000
- [j15]Amel Harkat-Benhamdine, Hao Li, Feng Tian:
Cyclability of 3-connected graphs. J. Graph Theory 34(3): 191-203 (2000) - 1999
- [j14]Feng Tian, Bing Wei, Lei Zhang:
Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2. Discret. Appl. Math. 92(1): 57-70 (1999) - [j13]Yu Sheng, Feng Tian, Bing Wei:
Panconnectivity of locally connected claw-free graphs. Discret. Math. 203(1-3): 253-260 (1999) - [j12]Evelyne Flandrin, Feng Tian, Bing Wei, Lei Zhang:
Some properties of 3-domination-critical graphs. Discret. Math. 205(1-3): 65-76 (1999) - [j11]Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian:
An Ore-type condition for pancyclability. Discret. Math. 206(1-3): 139-144 (1999) - 1998
- [j10]Feng Tian, Bing Wei:
Some new localization theorems on Hamiltonian properties. Australas. J Comb. 17: 61-68 (1998) - 1997
- [j9]Ruqun Shen, Feng Tian, Bing Wei:
Hamiltonicity of k-connected graphs with independent claws. Ars Comb. 47 (1997) - [j8]Hao Li, Mei Lu, Feng Tian, Bing Wei:
Hamiltonicity of 2-connected claw-center independent graphs. Discret. Math. 165-166: 469-479 (1997) - [j7]Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman:
Cycles through subsets with large degree sums. Discret. Math. 171(1-3): 43-54 (1997) - [j6]Ruqun Shen, Feng Tian:
Long dominating cycles in graphs. Discret. Math. 177(1-3): 287-294 (1997) - [j5]Odile Favaron, Feng Tian, Lei Zhang:
Independence and hamiltonicity in 3-domination-critical graphs. J. Graph Theory 25(3): 173-184 (1997) - 1996
- [j4]Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu:
Sequences, claws and cyclability of graphs. J. Graph Theory 21(4): 357-369 (1996) - 1995
- [j3]Ruqun Shen, Feng Tian:
Neighborhood unions and hamiltonicity of graphs. Discret. Math. 141(1-3): 213-225 (1995) - 1991
- [j2]Yongjin Zhu, Feng Tian, Xiaotie Deng:
More powerful closure operations on graphs. Discret. Math. 87(2): 197-214 (1991) - 1985
- [j1]Feng Tian, Xiaotie Deng, Ronghua Shi:
Smallest regular graphs with girth pair (4, 2t+1). Graphs Comb. 1(1): 201-202 (1985)
Conference and Workshop Papers
- 2003
- [c1]Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian:
Majority Equilibrium for Public Facility Allocation (Preliminary Version). COCOON 2003: 435-444
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-22 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
