The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bing Wei: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guantao Chen, Joan P. Hutchinson, Wiktor Piotrowski, Warren E. Shreve, Bing Wei
    Degree Sequences with Repeated Values. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  2. Xiangwen Li, Bing Wei, Fan Yang
    Independent Cycles in a Bipartite Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  3. Ruqun Shen, Feng Tian, Bing Wei
    Hamiltonicity of k-connected graphs with independent claws. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  4. Feng Tian, Bing Wei, Zhang Lei
    Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:1, pp:57-70 [Journal]
  5. Xiangwen Li, Bing Wei, Fan Yang
    A degree condition of 2-factors in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:311-318 [Journal]
  6. Guantao Chen, Akira Saito, Bing Wei, Xuerong Zhang
    The hamiltonicity of bipartite graphs involving neighborhood unions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:45-56 [Journal]
  7. Yaojun Chen, Feng Tian, Bing Wei
    Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:1-12 [Journal]
  8. Xiangwen Li, Bing Wei, Zhengguang Yu, Yongjin Zhu
    Hamilton cycles in 1-tough triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:275-287 [Journal]
  9. Bing Wei, Yongjin Zhu
    The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:203-214 [Journal]
  10. Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu
    Path extendability of claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:2010-2015 [Journal]
  11. Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei
    On Ranks of Matrices Associated with Trees. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:3, pp:323-334 [Journal]
  12. Yaojun Chen, Feng Tian, Bing Wei
    Degree Sums and Path-Factors in Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:1, pp:61-71 [Journal]
  13. Guantao Chen, Bing Wei, Xuerong Zhang
    Degree-Light-Free Graphs and Hamiltonian Cycles. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:409-434 [Journal]
  14. Zhiren Sun, Feng Tian, Bing Wei
    Degree Sums, Connectivity and Dominating Cycles in Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:555-564 [Journal]
  15. Zhiren Sun, Feng Tian, Bing Wei
    Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:565-577 [Journal]
  16. Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei
    Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:4, pp:445-454 [Journal]
  17. Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei
    Extremal graphs for intersecting cliques. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:2, pp:159-171 [Journal]
  18. Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
    Long cycles in triangle-free graphs with prescribed independence number and connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:43-55 [Journal]
  19. Zhiquan Hu, Feng Tian, Bing Wei
    Long Cycles through a Linear Forest. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:67-80 [Journal]
  20. Bing Wei
    On the Circumferences of Regular 2-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:88-99 [Journal]
  21. Bing Wei
    A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:157-159 [Journal]
  22. Guantao Chen, Ronald J. Gould, K. Kawarabayashi, Florian Pfender, Bing Wei
    Graph minors and linkages. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:75-91 [Journal]
  23. Zhiquan Hu, Feng Tian, Bing Wei
    Hamilton connectivity of line graphs and claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:2, pp:130-141 [Journal]
  24. Guantao Chen, Warren E. Shreve, Bing Wei
    Hamiltonian graphs involving neighborhood unions. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:2, pp:83-100 [Journal]
  25. Yu Sheng, Feng Tian, Bing Wei
    Panconnectivity of locally connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:253-260 [Journal]
  26. Evelyne Flandrin, Feng Tian, Bing Wei, Lei Zhang
    Some properties of 3-domination-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:65-76 [Journal]
  27. Hao Li, Mei Lu, Feng Tian, Bing Wei
    Hamiltonicity of 2-connected claw-center independent graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:469-479 [Journal]
  28. Bing Wei
    Hamiltonian paths and hamiltonian connectivity in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:223-228 [Journal]

  29. Independence polynomials of k-tree related graphs. [Citation Graph (, )][DBLP]


  30. On deletions of largest bonds in graphs. [Citation Graph (, )][DBLP]


  31. Long cycles containing k-ordered vertices in graphs. [Citation Graph (, )][DBLP]


  32. A sufficient condition for pancyclability of graphs. [Citation Graph (, )][DBLP]


  33. Some properties of k-trees. [Citation Graph (, )][DBLP]


Search in 0.179secs, Finished in 0.181secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002