Bing Wei

Orcid: 0000-0002-6932-0251

Affiliations:
  • University of Mississippi, Department of Mathematics, University, MS, USA
  • Chinese Academy of Sciences, Institute of Systems Science, Beijing, China (former)


According to our database1, Bing Wei authored at least 59 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Bonds Intersecting Long Paths in \(k\) -Connected Graphs.
SIAM J. Discret. Math., June, 2023

2022
Independent bondage number of planar graphs with minimum degree at least 3.
Discret. Math., 2022

Gallai-Ramsey numbers for graphs with five vertices and chromatic number four.
Australas. J Comb., 2022

2021
Long cycles through specified vertices.
Discret. Math., 2021

Gallai-Ramsey numbers for graphs with chromatic number three.
Discret. Appl. Math., 2021

2020
A note on Gallai-Ramsey number of even wheels.
Discret. Math., 2020

2019
Independent bondage number of a graph.
J. Comb. Optim., 2019

2016
Degree conditions for weakly geodesic pancyclic graphs and their exceptions.
J. Comb. Optim., 2016

Multiplicative Zagreb indices of cacti.
Discret. Math. Algorithms Appl., 2016

2015
Degree Sum Condition for k-ordered Hamiltonian Connected Graphs.
Graphs Comb., 2015

Multiplicative Zagreb indices of k-trees.
Discret. Appl. Math., 2015

2014
Sharp bounds of the Zagreb indices of k-trees.
J. Comb. Optim., 2014

Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees.
Discret. Math., 2014

Long Paths containing k-ordered vertices in Graphs.
Ars Comb., 2014

2013
A bound on the values of independence polynomials at -1/<i>k</i>-1/k for <i>k</i>k-degenerate graphs.
Discret. Math., 2013

2012
Independence polynomials of some compound graphs.
Discret. Appl. Math., 2012

2011
Sharp bounds for Zagreb indices of maximal outerplanar graphs.
J. Comb. Optim., 2011

Cycles in Triangle-Free Graphs.
Discret. Math. Algorithms Appl., 2011

2010
Some properties of k-trees.
Discret. Math., 2010

Independence polynomials of k-tree related graphs.
Discret. Appl. Math., 2010

2009
A sufficient condition for pancyclability of graphs.
Discret. Math., 2009

2008
Long cycles containing k-ordered vertices in graphs.
Discret. Math., 2008

On deletions of largest bonds in graphs.
Discret. Math., 2008

2006
Hamiltonian graphs involving neighborhood unions.
J. Graph Theory, 2006

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.
J. Comb. Optim., 2006

Path extendability of claw-free graphs.
Discret. Math., 2006

2005
Hamilton connectivity of line graphs and claw-free graphs.
J. Graph Theory, 2005

Graph minors and linkages.
J. Graph Theory, 2005

Largest circuits in matroids.
Adv. Appl. Math., 2005

2004
Some remarks on domination.
J. Graph Theory, 2004

Long cycles in triangle-free graphs with prescribed independence number and connectivity.
J. Comb. Theory B, 2004

Independent Cycles in a Bipartite Graph.
Ars Comb., 2004

2003
Extremal graphs for intersecting cliques.
J. Comb. Theory B, 2003

On Ranks of Matrices Associated with Trees.
Graphs Comb., 2003

Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta.
Discret. Math., 2003

2002
Fan-type theorem for path-connectivity.
J. Graph Theory, 2002

Codiameters of 3-connected 3-domination critical graphs.
J. Graph Theory, 2002

The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs.
Discret. Math., 2002

Hamilton cycles in 1-tough triangle-free graphs.
Discret. Math., 2002

The hamiltonicity of bipartite graphs involving neighborhood unions.
Discret. Math., 2002

2001
Long Cycles through a Linear Forest.
J. Comb. Theory B, 2001

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

Degree Sums, Connectivity and Dominating Cycles in Graphs.
Graphs Comb., 2001

Degree-Light-Free Graphs and Hamiltonian Cycles.
Graphs Comb., 2001

Degree Sums and Path-Factors in Graphs.
Graphs Comb., 2001

A degree condition of 2-factors in bipartite graphs.
Discret. Appl. Math., 2001

Degree Sequences with Repeated Values.
Ars Comb., 2001

1999
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs.
J. Comb. Theory B, 1999

On the Circumferences of Regular 2-Connected Graphs.
J. Comb. Theory B, 1999

Panconnectivity of locally connected claw-free graphs.
Discret. Math., 1999

Some properties of 3-domination-critical graphs.
Discret. Math., 1999

Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2.
Discret. Appl. Math., 1999

1998
Some new localization theorems on Hamiltonian properties.
Australas. J Comb., 1998

1997
Hamiltonian κ-factors in graphs.
J. Graph Theory, 1997

Hamiltonicity of 2-connected claw-center independent graphs.
Discret. Math., 1997

Hamiltonicity of k-connected graphs with independent claws.
Ars Comb., 1997

1996
Hamiltonian cycles in 1-tough graphs.
Graphs Comb., 1996

1993
A generalization of a result of Bauer and Schmeichel.
Graphs Comb., 1993

Hamiltonian paths and hamiltonian connectivity in graphs.
Discret. Math., 1993


  Loading...