default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBing Wei 0001
Person information
- affiliation: University of Mississippi, Department of Mathematics, University, MS, USA
- affiliation (former): Chinese Academy of Sciences, Institute of Systems Science, Beijing, China
Other persons with the same name
- Bing Wei — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j59]Qinghong Zhao
, Bing Wei, Haidong Wu:
Bonds Intersecting Long Paths in \(k\) -Connected Graphs. SIAM J. Discret. Math. 37(2): 733-747 (2023)- 2022
- [j58]Qinghong Zhao, Bing Wei:
Gallai-Ramsey numbers for graphs with five vertices and chromatic number four. Australas. J Comb. 83: 141-162 (2022) - [j57]Andrew Pham, Bing Wei:
Independent bondage number of planar graphs with minimum degree at least 3. Discret. Math. 345(12): 113072 (2022) - 2021
- [j56]Qinghong Zhao, Bing Wei:
Gallai-Ramsey numbers for graphs with chromatic number three. Discret. Appl. Math. 304: 110-118 (2021) - [j55]Shuchao Li, Xuechao Li, Bing Wei:
Long cycles through specified vertices. Discret. Math. 344(4): 112274 (2021) - 2020
- [j54]Zi-Xia Song, Bing Wei, Fangfang Zhang, Qinghong Zhao:
A note on Gallai-Ramsey number of even wheels. Discret. Math. 343(3): 111725 (2020)
2010 – 2019
- 2019
- [j53]Bruce Priddy, Haiying Wang, Bing Wei:
Independent bondage number of a graph. J. Comb. Optim. 37(2): 702-712 (2019) - 2016
- [j52]Shaohui Wang, Bing Wei:
Multiplicative Zagreb indices of cacti. Discret. Math. Algorithms Appl. 8(3): 1650040:1-1650040:15 (2016) - [j51]Emlee W. Nicholson, Bing Wei:
Degree conditions for weakly geodesic pancyclic graphs and their exceptions. J. Comb. Optim. 31(2): 912-917 (2016) - 2015
- [j50]Shaohui Wang, Bing Wei:
Multiplicative Zagreb indices of k-trees. Discret. Appl. Math. 180: 168-175 (2015) - [j49]Emlee W. Nicholson, Bing Wei:
Degree Sum Condition for k-ordered Hamiltonian Connected Graphs. Graphs Comb. 31(3): 743-755 (2015) - 2014
- [j48]Emlee W. Nicholson, Bing Wei:
Long Paths containing k-ordered vertices in Graphs. Ars Comb. 114: 437-448 (2014) - [j47]Xuechao Li, Bing Wei:
Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees. Discret. Math. 334: 1-12 (2014) - [j46]John W. Estes, Bing Wei:
Sharp bounds of the Zagreb indices of k-trees. J. Comb. Optim. 27(2): 271-291 (2014) - 2013
- [j45]John W. Estes, William Staton, Bing Wei:
A bound on the values of independence polynomials at -1/k-1/k for kk-degenerate graphs. Discret. Math. 313(18): 1793-1798 (2013) - 2012
- [j44]Lanzhen Song, William Staton, Bing Wei:
Independence polynomials of some compound graphs. Discret. Appl. Math. 160(4-5): 657-663 (2012) - 2011
- [j43]Xiaojuan Li, Bing Wei, Yongjin Zhu:
Cycles in Triangle-Free Graphs. Discret. Math. Algorithms Appl. 3(3): 343-356 (2011) - [j42]Ailin Hou, Shuchao Li, Lanzhen Song, Bing Wei:
Sharp bounds for Zagreb indices of maximal outerplanar graphs. J. Comb. Optim. 22(2): 252-269 (2011) - 2010
- [j41]Lanzhen Song, William Staton, Bing Wei:
Independence polynomials of k-tree related graphs. Discret. Appl. Math. 158(8): 943-950 (2010) - [j40]James M. Shook, Bing Wei:
Some properties of k-trees. Discret. Math. 310(17-18): 2415-2425 (2010)
2000 – 2009
- 2009
- [j39]Evelyne Flandrin, Hao Li, Bing Wei:
A sufficient condition for pancyclability of graphs. Discret. Math. 309(1): 144-150 (2009) - 2008
- [j38]Nolan McMurray, Talmage James Reid, Laura Sheppardson, Bing Wei, Haidong Wu:
On deletions of largest bonds in graphs. Discret. Math. 308(7): 1137-1141 (2008) - [j37]Emlee W. Nicholson, Bing Wei:
Long cycles containing k-ordered vertices in graphs. Discret. Math. 308(9): 1563-1570 (2008) - 2006
- [j36]Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu:
Path extendability of claw-free graphs. Discret. Math. 306(16): 2010-2015 (2006) - [j35]Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei:
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11(4): 445-454 (2006) - [j34]Guantao Chen, Warren E. Shreve, Bing Wei:
Hamiltonian graphs involving neighborhood unions. J. Graph Theory 53(2): 83-100 (2006) - 2005
- [j33]Nolan McMurray, Talmage James Reid, Bing Wei, Haidong Wu:
Largest circuits in matroids. Adv. Appl. Math. 34(1): 213-216 (2005) - [j32]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - [j31]Zhiquan Hu, Feng Tian, Bing Wei:
Hamilton connectivity of line graphs and claw-free graphs. J. Graph Theory 50(2): 130-141 (2005) - 2004
- [j30]Xiangwen Li, Bing Wei, Fan Yang:
Independent Cycles in a Bipartite Graph. Ars Comb. 73 (2004) - [j29]Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei:
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory B 91(1): 43-55 (2004) - [j28]Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster:
Some remarks on domination. J. Graph Theory 46(3): 207-210 (2004) - 2003
- [j27]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) - [j26]Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei:
On Ranks of Matrices Associated with Trees. Graphs Comb. 19(3): 323-334 (2003) - [j25]Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei:
Extremal graphs for intersecting cliques. J. Comb. Theory B 89(2): 159-171 (2003) - 2002
- [j24]Guantao Chen, Akira Saito, Bing Wei, Xuerong Zhang:
The hamiltonicity of bipartite graphs involving neighborhood unions. Discret. Math. 249(1-3): 45-56 (2002) - [j23]Bing Wei, Yongjin Zhu:
The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs. Discret. Math. 252(1-3): 203-214 (2002) - [j22]Xiangwen Li, Bing Wei, Zhengguang Yu, Yongjin Zhu:
Hamilton cycles in 1-tough triangle-free graphs. Discret. Math. 254(1-3): 275-287 (2002) - [j21]Yaojun Chen, Feng Tian, Bing Wei:
Codiameters of 3-connected 3-domination critical graphs. J. Graph Theory 39(1): 76-85 (2002) - [j20]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
- [j19]Guantao Chen, Joan P. Hutchinson, Wiktor Piotrowski, Warren E. Shreve, Bing Wei:
Degree Sequences with Repeated Values. Ars Comb. 59 (2001) - [j18]Xiangwen Li, Bing Wei, Fan Yang:
A degree condition of 2-factors in bipartite graphs. Discret. Appl. Math. 113(2-3): 311-318 (2001) - [j17]Yaojun Chen, Feng Tian, Bing Wei:
Degree Sums and Path-Factors in Graphs. Graphs Comb. 17(1): 61-71 (2001) - [j16]Guantao Chen, Bing Wei, Xuerong Zhang:
Degree-Light-Free Graphs and Hamiltonian Cycles. Graphs Comb. 17(3): 409-434 (2001) - [j15]Zhiren Sun, Feng Tian, Bing Wei:
Degree Sums, Connectivity and Dominating Cycles in Graphs. Graphs Comb. 17(3): 555-564 (2001) - [j14]Zhiren Sun, Feng Tian, Bing Wei:
Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. Graphs Comb. 17(3): 565-577 (2001) - [j13]Zhiquan Hu, Feng Tian, Bing Wei:
Long Cycles through a Linear Forest. J. Comb. Theory B 82(1): 67-80 (2001)
1990 – 1999
- 1999
- [j12]Feng Tian, Bing Wei, Lei Zhang:
Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2. Discret. Appl. Math. 92(1): 57-70 (1999) - [j11]Yu Sheng, Feng Tian, Bing Wei:
Panconnectivity of locally connected claw-free graphs. Discret. Math. 203(1-3): 253-260 (1999) - [j10]Evelyne Flandrin, Feng Tian, Bing Wei, Lei Zhang:
Some properties of 3-domination-critical graphs. Discret. Math. 205(1-3): 65-76 (1999) - [j9]Bing Wei:
On the Circumferences of Regular 2-Connected Graphs. J. Comb. Theory B 75(1): 88-99 (1999) - [j8]Bing Wei:
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs. J. Comb. Theory B 75(1): 157-159 (1999) - 1998
- [j7]Feng Tian, Bing Wei:
Some new localization theorems on Hamiltonian properties. Australas. J Comb. 17: 61-68 (1998) - 1997
- [j6]Ruqun Shen, Feng Tian, Bing Wei:
Hamiltonicity of k-connected graphs with independent claws. Ars Comb. 47 (1997) - [j5]Hao Li, Mei Lu, Feng Tian, Bing Wei:
Hamiltonicity of 2-connected claw-center independent graphs. Discret. Math. 165-166: 469-479 (1997) - [j4]Bing Wei, Yongjin Zhu:
Hamiltonian κ-factors in graphs. J. Graph Theory 25(3): 217-227 (1997) - 1996
- [j3]Bing Wei:
Hamiltonian cycles in 1-tough graphs. Graphs Comb. 12(1): 385-395 (1996) - 1993
- [j2]Bing Wei:
Hamiltonian paths and hamiltonian connectivity in graphs. Discret. Math. 121(1-3): 223-228 (1993) - [j1]Bing Wei:
A generalization of a result of Bauer and Schmeichel. Graphs Comb. 9(2-4): 383-389 (1993)
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-11-19 21:47 CET 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:
