The SCEAS System
| |||||||

## Search the dblp DataBase
Yuqing Lin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - Yuqing Lin, Mirka Miller, Camino Balbuena
**Improved lower bound for the vertex connectivity of (**[Citation Graph (0, 0)][DBLP]*delta;*;*g*)-cages. Discrete Mathematics, 2005, v:299, n:1-3, pp:162-171 [Journal] - 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] - 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] - Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote
**All (**[Citation Graph (0, 0)][DBLP]*k*;*g*)-cages are edge-superconnected. Networks, 2006, v:47, n:2, pp:102-110 [Journal] - Yuqing Lin, Mirka Miller, Chris Rodger
**All (**[Citation Graph (0, 0)][DBLP]*k*;*g*)-cages are*k*-edge-connected. Journal of Graph Theory, 2005, v:48, n:3, pp:219-227 [Journal] - 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] **An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected.**[Citation Graph (, )][DBLP]**An Approach to Efficient Product Configuration in Software Product Lines.**[Citation Graph (, )][DBLP]**Face antimagic labelings of plane graphs Pba.**[Citation Graph (, )][DBLP]**Diameter-sufficient conditions for a graph to be super-restricted connected.**[Citation Graph (, )][DBLP]**Superconnectivity of regular graphs with small diameter.**[Citation Graph (, )][DBLP]**On the number of components of (k, g)-cages after vertex deletion.**[Citation Graph (, )][DBLP]**Calculating the extremal number ex(v;{C**[Citation Graph (, )][DBLP]_{3}, C_{4}, ..., C_{n}}).**On the connectivity of (k, g)-cages of even girth.**[Citation Graph (, )][DBLP]**Super-vertex-antimagic total labelings of disconnected graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |