dblp.uni-trier.dewww.uni-trier.de

Guizhen Liu

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
48EEJiansheng Cai, Guizhen Liu, Jianfeng Hou: The stability number and connected [k, k+1]-factor in graphs. Appl. Math. Lett. 22(6): 927-931 (2009)
47EEJianfeng Hou, Guizhen Liu, Jiansheng Cai: Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. Discrete Mathematics 309(1): 77-84 (2009)
46EEGuanghui Wang, Guizhen Liu: Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23): 1982-1985 (2009)
2008
45EEXia Zhang, Guizhen Liu: Some graphs of class 1 for f-colorings. Appl. Math. Lett. 21(1): 23-29 (2008)
44 Xia Zhang, Jihui Wang, Guizhen Liu: The Classification of Regular Graphs on f-colorings. Ars Comb. 86: (2008)
43 Guizhen Liu, Qinglin Yu: Strongly pan-factorial property in cages. Ars Comb. 87: (2008)
42 Jiansheng Cai, Guizhen Liu: Stability Number and f-factor in K1, n-free Graphs. Ars Comb. 89: (2008)
41EEGuizhen Liu, Lanju Zhang: Characterizations of maximum fractional (g, f)-factors of graphs. Discrete Applied Mathematics 156(12): 2293-2299 (2008)
40EEChangqing Xu, Guizhen Liu: Edge covered critical multigraphs. Discrete Mathematics 308(24): 6348-6354 (2008)
39EEChangqing Xu, Guizhen Liu: A note on the edge cover chromatic index of multigraphs. Discrete Mathematics 308(24): 6564-6568 (2008)
38EEGuizhen Liu, Lanju Zhang: Toughness and the existence of fractional k-factors of graphs. Discrete Mathematics 308(9): 1741-1748 (2008)
37EEMeijie Ma, Guizhen Liu, Jun-Ming Xu: The super connectivity of augmented cubes. Inf. Process. Lett. 106(2): 59-63 (2008)
36EEBin Liu, Jianfeng Hou, Guizhen Liu: List edge and list total colorings of planar graphs without short cycles. Inf. Process. Lett. 108(6): 347-351 (2008)
35EEJiansheng Cai, Guizhen Liu, Jianfeng Hou: Binding number and Hamiltonian (g, f)-factors in graphs II. Int. J. Comput. Math. 85(9): 1325-1331 (2008)
34EEGuizhen Liu, Ping Li: Paths in circuit graphs of matroids. Theor. Comput. Sci. 396(1-3): 258-263 (2008)
33EEMeijie Ma, Guizhen Liu, Jun-Ming Xu: Fault-tolerant embedding of paths in crossed cubes. Theor. Comput. Sci. 407(1-3): 110-116 (2008)
2007
32EEJiguo Yu, Guizhen Liu: Notes on Fractional (1, f )-Odd Factors of Graphs. FAW 2007: 310-316
31 Jiguo Yu, Na Wang, Xingjian Feng, Guizhen Liu: A Note on Factional Extendable Graphs. IMECS 2007: 2270-2273
30EEJiansheng Cai, Guizhen Liu, Jianfeng Hou: Binding Number and Connected ( g , f + 1)-Factors in Graphs. International Conference on Computational Science (3) 2007: 313-319
29EEJianfeng Hou, Guizhen Liu, Jianliang Wu: Some Results on List Total Colorings of Planar Graphs. International Conference on Computational Science (3) 2007: 320-328
28EEXia Zhang, Guizhen Liu: A Class of Graphs of f -Class 1. International Conference on Computational Science (3) 2007: 362-369
27EEPing Li, Guizhen Liu: The Edge Connectivity of Circuit Graphs of Matroids. International Conference on Computational Science (3) 2007: 440-443
26EEHuimin Song, Jianliang Wu, Guizhen Liu: The Equitable Edge-Coloring of Series-Parallel Graphs. International Conference on Computational Science (3) 2007: 457-460
25EEGuizhen Liu, Qinglin Yu, Lanju Zhang: Maximum fractional factors in graphs. Appl. Math. Lett. 20(12): 1237-1243 (2007)
24EEMeijie Ma, Guizhen Liu, Xiangfeng Pan: Path embedding in faulty hypercubes. Applied Mathematics and Computation 192(1): 233-238 (2007)
23 Jin Yan, Guizhen Liu: On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph. Ars Comb. 82: (2007)
22 Jihui Wang, Guizhen Liu: Some Results on Fractional Edge Coloring of Graphs. Ars Comb. 83: (2007)
21EEGuizhen Liu, Jianfeng Hou, Jiansheng Cai: Some results about f-critical graphs. Networks 50(3): 197-202 (2007)
20EEMeijie Ma, Guizhen Liu, Jun-Ming Xu: Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. Parallel Computing 33(1): 36-42 (2007)
19EEJianliang Wu, Jianfeng Hou, Guizhen Liu: The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci. 381(1-3): 230-233 (2007)
2006
18EEXia Zhang, Guizhen Liu: Some sufficient conditions for a graph to be of Cf 1. Appl. Math. Lett. 19(1): 38-44 (2006)
17 Jiansheng Cai, Guizhen Liu: Stability Number and Fractional F-factors in Graphs. Ars Comb. 80: (2006)
16EEKefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discrete Mathematics 306(7): 670-672 (2006)
15EEJianfeng Hou, Guizhen Liu, Jiansheng Cai: List edge and list total colorings of planar graphs without 4-cycles. Theor. Comput. Sci. 369(1-3): 250-255 (2006)
2005
14EEGuizhen Liu, Changqing Xu: Some Topics on Edge-Coloring. CJCDGCGT 2005: 101-108
2004
13EEGuizhen Liu, Wenan Zang: f-Factors in bipartite (mf)-graphs. Discrete Applied Mathematics 136(1): 45-54 (2004)
12EEYan Liu, Guizhen Liu: Number of maximum matchings of bipartite graphs with positive surplus. Discrete Mathematics 274(1-3): 311-318 (2004)
2003
11EEGuizhen Liu, Binhai Zhu: Some Problems on Factorizations with Constraints in Bipartite Graphs. Discrete Applied Mathematics 128(2-3): 421-434 (2003)
2002
10EEMao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu: A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. IPCO 2002: 304-314
9EEXiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu: A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. Int. J. Found. Comput. Sci. 13(6): 817-827 (2002)
8EEYan Liu, Guizhen Liu: The fractional matching numbers of graphs. Networks 40(4): 228-231 (2002)
2001
7EEGuizhen Liu, Qinglin Yu: Generalization of matching extensions in graphs. Discrete Mathematics 231(1-3): 311-320 (2001)
2000
6EEPeter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu: Orthogonal (g, f)-factorizations in networks. Networks 35(4): 274-278 (2000)
1998
5 Guizhen Liu, Qinglin Yu: Toughness and Perfect Matchings in Graphs. Ars Comb. 48: (1998)
4EELitong Xie, Guizhen Liu, Baogang Xu: On endo-homology of complexes of graphs. Discrete Mathematics 188(1-3): 285-291 (1998)
1995
3EEGuizhen Liu: Orthogonal (g, f)-factorizations in graphs. Discrete Mathematics 143(1-3): 153-158 (1995)
1990
2EEKatherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu: A simple existence criterion for (g<f)- factors. Discrete Mathematics 85(3): 313-317 (1990)
1988
1EEGuizhen Liu: A lower bound on connectivities of matroid base graphs. Discrete Mathematics 69(1): 55-60 (1988)

Coauthor Index

1Jiansheng Cai [15] [17] [21] [30] [35] [42] [47] [48]
2Mao-cheng Cai [10]
3Xiaotie Deng [9] [10]
4Kefeng Diao [16]
5Haodi Feng [9] [10]
6Xingjian Feng [31]
7Katherine Heinrich [2]
8Pavol Hell [2]
9Jianfeng Hou [15] [19] [21] [29] [30] [35] [36] [47] [48]
10David G. Kirkpatrick [2]
11Peter Che Bor Lam [6]
12Guojun Li [6] [9] [10]
13Ping Li [27] [34]
14Bin Liu [36]
15Yan Liu (Yan (Jenny) Liu) [8] [12]
16Meijie Ma [20] [24] [33] [37]
17Xiangfeng Pan [24]
18Dieter Rautenbach [16]
19Wai Chee Shiu [6]
20Huimin Song [26]
21Guanghui Wang [46]
22Jihui Wang [22] [44]
23Na Wang [31]
24Jianliang Wu [19] [26] [29]
25Litong Xie [4]
26Baogang Xu [4]
27Changqing Xu [14] [39] [40]
28Jun-Ming Xu [20] [33] [37]
29Jin Yan [23]
30Jiguo Yu [31] [32]
31Qinglin Yu [5] [7] [25] [43]
32Wenan Zang [13]
33Lanju Zhang [25] [38] [41]
34Xia Zhang [18] [28] [44] [45]
35Ping Zhao [16]
36Binhai Zhu [11]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)