The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zhiquan Hu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zhiquan Hu, Zhenhong Liu
    A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:135-154 [Journal]
  2. Zhiquan Hu, Hao Li
    Partition of a graph into cycles and vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1436-1440 [Journal]
  3. Xujin Chen, Zhiquan Hu, Wenan Zang
    Perfect Circular Arc Coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:3, pp:267-280 [Journal]
  4. Zhiquan Hu, Feng Tian, Bing Wei
    Long Cycles through a Linear Forest. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:67-80 [Journal]
  5. Zhiquan Hu, Feng Tian, Bing Wei
    Hamilton connectivity of line graphs and claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:2, pp:130-141 [Journal]
  6. Zhiquan Hu
    A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:196, n:1-3, pp:167-175 [Journal]

  7. A constructive characterization of total domination vertex critical graphs. [Citation Graph (, )][DBLP]


  8. Removable matchings and hamiltonian cycles. [Citation Graph (, )][DBLP]


  9. Weak cycle partition involving degree sum conditions. [Citation Graph (, )][DBLP]


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