The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yingqian Wang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Liang Shen, Yingqian Wang
    A sufficient condition for a planar graph to be 3-choosable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:146-151 [Journal]

  2. On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. [Citation Graph (, )][DBLP]


  3. Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. [Citation Graph (, )][DBLP]


  4. Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable. [Citation Graph (, )][DBLP]


  5. On the diameter of generalized Kneser graphs. [Citation Graph (, )][DBLP]


  6. On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. [Citation Graph (, )][DBLP]


  7. Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. [Citation Graph (, )][DBLP]


  8. Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. [Citation Graph (, )][DBLP]


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