The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yuanqiu Huang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuanqiu Huang, Yuming Chu
    A note on the computational complexity of graph vertex partition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:405-409 [Journal]
  2. Yuanqiu Huang
    Maximum genus and chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:117-127 [Journal]
  3. Yuanqiu Huang
    Maximum genus of a graph in terms of its embedding properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:171-180 [Journal]
  4. Yuanqiu Huang, Tinglei Zhao
    Maximum genus, connectivity and minimal degree of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:110-119 [Journal]
  5. Yuanqiu Huang, Yanpei Liu
    Face Size and the Maximum Genus of a Graph 1. Simple Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:356-370 [Journal]
  6. Yuanqiu Huang, Yanpei Liu
    The maximum genus of graphs with diameter three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:139-149 [Journal]

  7. The crossing number of K1, 4, n. [Citation Graph (, )][DBLP]


  8. On the lower bounds for the maximum genus for simple graphs. [Citation Graph (, )][DBLP]


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