The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Guizhen Liu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu
    A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:304-314 [Conf]
  2. Xia Zhang, Guizhen Liu
    Some sufficient conditions for a graph to be of Cf 1. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:1, pp:38-44 [Journal]
  3. Guizhen Liu, Qinglin Yu
    Toughness and Perfect Matchings in Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:48, n:, pp:- [Journal]
  4. Guizhen Liu, Binhai Zhu
    Some Problems on Factorizations with Constraints in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:421-434 [Journal]
  5. Guizhen Liu, Wenan Zang
    f-Factors in bipartite (mf)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:1, pp:45-54 [Journal]
  6. Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao
    A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:670-672 [Journal]
  7. Yan Liu, Guizhen Liu
    Number of maximum matchings of bipartite graphs with positive surplus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:311-318 [Journal]
  8. Guizhen Liu, Qinglin Yu
    Generalization of matching extensions in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:311-320 [Journal]
  9. Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu
    A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:6, pp:817-827 [Journal]
  10. Peter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu
    Orthogonal (g, f)-factorizations in networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:4, pp:274-278 [Journal]
  11. Yan Liu, Guizhen Liu
    The fractional matching numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:4, pp:228-231 [Journal]
  12. Meijie Ma, Guizhen Liu, Jun-Ming Xu
    Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2007, v:33, n:1, pp:36-42 [Journal]
  13. Jianfeng Hou, Guizhen Liu, Jiansheng Cai
    List edge and list total colorings of planar graphs without 4-cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:250-255 [Journal]
  14. Jiansheng Cai, Guizhen Liu, Jianfeng Hou
    Binding Number and Connected ( g , f + 1)-Factors in Graphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:313-319 [Conf]
  15. Jianfeng Hou, Guizhen Liu, Jianliang Wu
    Some Results on List Total Colorings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:320-328 [Conf]
  16. Xia Zhang, Guizhen Liu
    A Class of Graphs of f -Class 1. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:362-369 [Conf]
  17. Ping Li, Guizhen Liu
    The Edge Connectivity of Circuit Graphs of Matroids. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:440-443 [Conf]
  18. Huimin Song, Jianliang Wu, Guizhen Liu
    The Equitable Edge-Coloring of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:457-460 [Conf]
  19. Jiguo Yu, Guizhen Liu
    Notes on Fractional (1, f )-Odd Factors of Graphs. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:310-316 [Conf]
  20. Guizhen Liu, Changqing Xu
    Some Topics on Edge-Coloring. [Citation Graph (0, 0)][DBLP]
    CJCDGCGT, 2005, pp:101-108 [Conf]
  21. Guizhen Liu
    A lower bound on connectivities of matroid base graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:55-60 [Journal]
  22. Litong Xie, Guizhen Liu, Baogang Xu
    On endo-homology of complexes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:285-291 [Journal]
  23. Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu
    A simple existence criterion for (g<f)- factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:3, pp:313-317 [Journal]
  24. Guizhen Liu
    Orthogonal (g, f)-factorizations in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:143, n:1-3, pp:153-158 [Journal]
  25. Jianliang Wu, Jianfeng Hou, Guizhen Liu
    The linear arboricity of planar graphs with no short cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:230-233 [Journal]

  26. A Note on Factional Extendable Graphs. [Citation Graph (, )][DBLP]


  27. Maximum fractional factors in graphs. [Citation Graph (, )][DBLP]


  28. Some graphs of class 1 for f-colorings. [Citation Graph (, )][DBLP]


  29. The stability number and connected [k, k+1]-factor in graphs. [Citation Graph (, )][DBLP]


  30. Strongly pan-factorial property in cages. [Citation Graph (, )][DBLP]


  31. Stability Number and f-factor in K1, n-free Graphs. [Citation Graph (, )][DBLP]


  32. The Classification of Regular Graphs on f-colorings. [Citation Graph (, )][DBLP]


  33. Stability Number and Fractional F-factors in Graphs. [Citation Graph (, )][DBLP]


  34. On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph. [Citation Graph (, )][DBLP]


  35. Some Results on Fractional Edge Coloring of Graphs. [Citation Graph (, )][DBLP]


  36. Structural properties of 1-planar graphs and an application to acyclic edge coloring [Citation Graph (, )][DBLP]


  37. Characterizations of maximum fractional (g, f)-factors of graphs. [Citation Graph (, )][DBLP]


  38. Toughness and the existence of fractional k-factors of graphs. [Citation Graph (, )][DBLP]


  39. A note on the edge cover chromatic index of multigraphs. [Citation Graph (, )][DBLP]


  40. Edge covered critical multigraphs. [Citation Graph (, )][DBLP]


  41. Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. [Citation Graph (, )][DBLP]


  42. On 2-factors with cycles containing specified edges in a bipartite graph. [Citation Graph (, )][DBLP]


  43. Total colorings and list total colorings of planar graphs without intersecting 4-cycles. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.330secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002