The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wensong Lin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Che Bor Lam, Guohua Gu, Wensong Lin, Ping-Tsai Chung
    Bounds On The Labelling Numbers Of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    FCS, 2006, pp:41-47 [Conf]
  2. Wensong Lin, Zengmin Song
    Neighborhood Union Condition with Distance for Vertex-pancyclicity. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  3. Jianzhuan Wu, Wensong Lin
    Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  4. Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu
    Several parameters of generalized Mycielskians. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1173-1182 [Journal]
  5. Wensong Lin
    Some star extremal circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:169-177 [Journal]
  6. Wensong Lin, Peter Che Bor Lam, Zengmin Song
    Circular chromatic numbers of some distance graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:292, n:1-3, pp:119-130 [Journal]
  7. Peter Che Bor Lam, Wensong Lin
    Coloring of distance graphs with intervals as distance sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:8, pp:1216-1229 [Journal]
  8. Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song
    Circular chromatic number and a generalization of the construction of Mycielski. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:2, pp:195-205 [Journal]
  9. Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu
    L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:219-227 [Journal]

  10. On time-relaxed broadcasting networks. [Citation Graph (, )][DBLP]


  11. Multicoloring and Mycielski construction. [Citation Graph (, )][DBLP]


  12. Distance two labelling and direct products of graphs. [Citation Graph (, )][DBLP]


  13. The strong chromatic index of a class of graphs. [Citation Graph (, )][DBLP]


  14. Circular game chromatic number of graphs. [Citation Graph (, )][DBLP]


Search in 0.083secs, Finished in 0.084secs
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