The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Martin Baca, Yuqing Lin, Mirka Miller, Joseph F. Ryan
    Antimagic labelings of Msbius grids. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2006, v:78, n:, pp:- [Journal]
  2. Yuqing Lin, Slamin, Martin Baca, Mirka Miller
    On d-antimagic labelings of prisms. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  3. Camino Balbuena, E. Barker, K. C. Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, K. A. Sugeng, Michal Tkác
    On the degrees of a strongly vertex-magic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:539-551 [Journal]
  4. Yuqing Lin, Mirka Miller, Camino Balbuena
    Improved lower bound for the vertex connectivity of (delta;;g)-cages. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:162-171 [Journal]
  5. Camino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, K. A. Sugeng
    Consecutive magic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1817-1829 [Journal]
  6. Martin Baca, Yuqing Lin, Mirka Miller, Maged Z. Youssef
    Edge-antimagic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1232-1244 [Journal]
  7. Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote
    All (k;g)-cages are edge-superconnected. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:2, pp:102-110 [Journal]
  8. Yuqing Lin, Mirka Miller, Chris Rodger
    All (k;g)-cages are k-edge-connected. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:3, pp:219-227 [Journal]
  9. Huilin Ye, Yuqing Lin
    A Formal Specification for Product Configuration in Software Product Lines. [Citation Graph (0, 0)][DBLP]
    SEKE, 2007, pp:221-226 [Conf]

  10. An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected. [Citation Graph (, )][DBLP]


  11. An Approach to Efficient Product Configuration in Software Product Lines. [Citation Graph (, )][DBLP]


  12. Face antimagic labelings of plane graphs Pba. [Citation Graph (, )][DBLP]


  13. Diameter-sufficient conditions for a graph to be super-restricted connected. [Citation Graph (, )][DBLP]


  14. Superconnectivity of regular graphs with small diameter. [Citation Graph (, )][DBLP]


  15. On the number of components of (k, g)-cages after vertex deletion. [Citation Graph (, )][DBLP]


  16. Calculating the extremal number ex(v;{C3, C4, ..., Cn}). [Citation Graph (, )][DBLP]


  17. On the connectivity of (k, g)-cages of even girth. [Citation Graph (, )][DBLP]


  18. Super-vertex-antimagic total labelings of disconnected graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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