2009 |
48 | EE | Jiansheng Cai,
Guizhen Liu,
Jianfeng Hou:
The stability number and connected [k, k+1]-factor in graphs.
Appl. Math. Lett. 22(6): 927-931 (2009) |
47 | EE | Jianfeng Hou,
Guizhen Liu,
Jiansheng Cai:
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discrete Mathematics 309(1): 77-84 (2009) |
46 | EE | Guanghui Wang,
Guizhen Liu:
Paths, cycles and circular colorings in digraphs.
Theor. Comput. Sci. 410(21-23): 1982-1985 (2009) |
2008 |
45 | EE | Xia 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) |
41 | EE | Guizhen Liu,
Lanju Zhang:
Characterizations of maximum fractional (g, f)-factors of graphs.
Discrete Applied Mathematics 156(12): 2293-2299 (2008) |
40 | EE | Changqing Xu,
Guizhen Liu:
Edge covered critical multigraphs.
Discrete Mathematics 308(24): 6348-6354 (2008) |
39 | EE | Changqing Xu,
Guizhen Liu:
A note on the edge cover chromatic index of multigraphs.
Discrete Mathematics 308(24): 6564-6568 (2008) |
38 | EE | Guizhen Liu,
Lanju Zhang:
Toughness and the existence of fractional k-factors of graphs.
Discrete Mathematics 308(9): 1741-1748 (2008) |
37 | EE | Meijie Ma,
Guizhen Liu,
Jun-Ming Xu:
The super connectivity of augmented cubes.
Inf. Process. Lett. 106(2): 59-63 (2008) |
36 | EE | Bin 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) |
35 | EE | Jiansheng Cai,
Guizhen Liu,
Jianfeng Hou:
Binding number and Hamiltonian (g, f)-factors in graphs II.
Int. J. Comput. Math. 85(9): 1325-1331 (2008) |
34 | EE | Guizhen Liu,
Ping Li:
Paths in circuit graphs of matroids.
Theor. Comput. Sci. 396(1-3): 258-263 (2008) |
33 | EE | Meijie Ma,
Guizhen Liu,
Jun-Ming Xu:
Fault-tolerant embedding of paths in crossed cubes.
Theor. Comput. Sci. 407(1-3): 110-116 (2008) |
2007 |
32 | EE | Jiguo 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 |
30 | EE | Jiansheng Cai,
Guizhen Liu,
Jianfeng Hou:
Binding Number and Connected ( g , f + 1)-Factors in Graphs.
International Conference on Computational Science (3) 2007: 313-319 |
29 | EE | Jianfeng Hou,
Guizhen Liu,
Jianliang Wu:
Some Results on List Total Colorings of Planar Graphs.
International Conference on Computational Science (3) 2007: 320-328 |
28 | EE | Xia Zhang,
Guizhen Liu:
A Class of Graphs of f -Class 1.
International Conference on Computational Science (3) 2007: 362-369 |
27 | EE | Ping Li,
Guizhen Liu:
The Edge Connectivity of Circuit Graphs of Matroids.
International Conference on Computational Science (3) 2007: 440-443 |
26 | EE | Huimin Song,
Jianliang Wu,
Guizhen Liu:
The Equitable Edge-Coloring of Series-Parallel Graphs.
International Conference on Computational Science (3) 2007: 457-460 |
25 | EE | Guizhen Liu,
Qinglin Yu,
Lanju Zhang:
Maximum fractional factors in graphs.
Appl. Math. Lett. 20(12): 1237-1243 (2007) |
24 | EE | Meijie 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) |
21 | EE | Guizhen Liu,
Jianfeng Hou,
Jiansheng Cai:
Some results about f-critical graphs.
Networks 50(3): 197-202 (2007) |
20 | EE | Meijie Ma,
Guizhen Liu,
Jun-Ming Xu:
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes.
Parallel Computing 33(1): 36-42 (2007) |
19 | EE | Jianliang 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 |
18 | EE | Xia 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) |
16 | EE | 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.
Discrete Mathematics 306(7): 670-672 (2006) |
15 | EE | Jianfeng 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 |
14 | EE | Guizhen Liu,
Changqing Xu:
Some Topics on Edge-Coloring.
CJCDGCGT 2005: 101-108 |
2004 |
13 | EE | Guizhen Liu,
Wenan Zang:
f-Factors in bipartite (mf)-graphs.
Discrete Applied Mathematics 136(1): 45-54 (2004) |
12 | EE | Yan Liu,
Guizhen Liu:
Number of maximum matchings of bipartite graphs with positive surplus.
Discrete Mathematics 274(1-3): 311-318 (2004) |
2003 |
11 | EE | Guizhen Liu,
Binhai Zhu:
Some Problems on Factorizations with Constraints in Bipartite Graphs.
Discrete Applied Mathematics 128(2-3): 421-434 (2003) |
2002 |
10 | EE | Mao-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 |
9 | EE | Xiaotie 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) |
8 | EE | Yan Liu,
Guizhen Liu:
The fractional matching numbers of graphs.
Networks 40(4): 228-231 (2002) |
2001 |
7 | EE | Guizhen Liu,
Qinglin Yu:
Generalization of matching extensions in graphs.
Discrete Mathematics 231(1-3): 311-320 (2001) |
2000 |
6 | EE | Peter 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) |
4 | EE | Litong Xie,
Guizhen Liu,
Baogang Xu:
On endo-homology of complexes of graphs.
Discrete Mathematics 188(1-3): 285-291 (1998) |
1995 |
3 | EE | Guizhen Liu:
Orthogonal (g, f)-factorizations in graphs.
Discrete Mathematics 143(1-3): 153-158 (1995) |
1990 |
2 | EE | Katherine Heinrich,
Pavol Hell,
David G. Kirkpatrick,
Guizhen Liu:
A simple existence criterion for (g<f)- factors.
Discrete Mathematics 85(3): 313-317 (1990) |
1988 |
1 | EE | Guizhen Liu:
A lower bound on connectivities of matroid base graphs.
Discrete Mathematics 69(1): 55-60 (1988) |