陈庆华论文发表

出版专著4部刘桂真，陈庆华，拟阵，国防科技大学出版社，1994谢力同，刘家壮，刘桂真，图与组合拓扑，山东大学出版社，1994刁在筠，刘桂真，宿洁，马建华，运筹学，高等教育出版社，2007 （作为“十一五”国家级规划教材出版第三版）黎伯堂，刘桂真，高等代数解题技巧与方法，山东科技出版社，19991990年以来共发表论文100多篇，代表作如下Xia Zhang and Guizhen Liu, Some graphs of class 1 for f-colorings, Applied Mathematics Letters 21 (2008), 23-29. (SCI)Guizhen Liu，Qinglin Yu, Lanju Zhang, Maximum fractional factors in graphs, Applied Mathematics Letters 20 (2007), 1237-1243. (SCI)Guizhen Liu, Yan Zhu, Jiansheng Cai, On the Randic index of unicyclic graphs with girth g, MATCH Commun. Math. Comput. 58 (2007),127-138. (SCI)Guizhen Liu, Jianfeng Hou, Jiansheng Cai, Some results about f-critical graphs, Networks 50(3) (2007), 197-202. (SCI)Meijie Ma, Guizhen Liu, Junming Xu, Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes, Parallel Computing 33 (2007), 36-42. (SCI)Jin Yan, Guizhen Liu, On 2-factors with quadrilaterals containing specified vertices in a bipartite graph, Ars Combinatorics 82 (2007),133-144. (SCI)Jianliang Wu, Jianfeng Hou and Guizhen Liu, The linear arboricity of planar graphs with no short cycles, Theoretical Computer Science 381 (2007), 230-233. (SCI)Ping Li, Guizhen Liu, Cycles in Circuit Graphs of Matroids, Graphs and Combinatorics 23 (2007), 425-431. (SCI)Jihui Wang, Guizhen Liu，Some results on fractional edge colorings of graphs, Ars Combinatorics 83 (2007), 249-255. (SCI)Meijie Ma, Guizhen Liu, Xiangfeng Pan, Path embedding in faulty hypercubes, Applied Mathematics and Computation 192 (2007), 233-238. (SCI)Kefeng Diao, Guizhen Liu, D. Rautenbach, P. Chao, A note on the lset number of edges of 3-uniform hypergraphs with upper chromatic number 2, Discrete Mathematics 306 (2006), 670-676. (SCI)Jianfeng Hou, Guizhen Liu, Jiansheng Cai, List edge and list total colorings of planar graphs without 4-cycles, Theoretical Computer Science 369 (2006), 250-255. (SCI)Liu Guizhen, Deng Xiaotie, Xu Changqing, Partitioning series-parallel multigraphs into v*-excluding edge covers, Science in China Series A Mathematics 49(8) (2006), 1082-1093. (SCI)Xia Zhang, Guizhen Liu, Some sufficient conditions for a graph to be of Cf1, Applied Mathematics Letters 19 (2006)，38-44. (SCI)Fan Hongbing, Liu Guizhen, Liu Jiping, Minimal regular 2-graphs and applications, Science in China Series A Mathematics 49(2) (2006),158-172. (SCI)Jiansheng Cai, Guizhen Liu, Stability number and fractional f-factors in graphs, Ars Combinatoria 80 (2006),141-146. (SCI)Jin Yan, Guizhen Liu, On 2–Factors with Prescribed Properties in a Bipartite Graph, Acta Mathematica Sinica 22(4) (2006), 1115-1120. (SCI)Liu Guizhen, Deng Xiaotie, A polynomial algorithm for finding (g,f)-coloring orthogonal to stars in bipartite graphs, Science in China Series A Mathematics (2005) 48(3), 322-332. (SCI)Liu Guizhen, Zhang Lanju, Properties of fractional k-factors of graphs, Acta Mathematica Sinica 25 B (2) (2005), 301-304. (SCI)Song Huimin, Liu Guizhen, On f-edge cover-coloring of simple graphs, Acta Mathematica Sinica 25 B (1) (2005), 145-151. (SCI)Liu Guizhen, Liu Yan, On (g,f)-uniform graphs, Acta Math. Appl. Sinica, English Ser. 21(4) (2005), 57-76.Liu Guizhen, W. Zang, f-factors in bipartite (m,f)-graphs, Discrete Applied Math. 136(1) (2004). (SCI)Yan Liu, Guizhen Liu, Number of maximum matchings of bipartite graphs with positive surplus, Discrete Math. 274 (2004), 311-318. (SCI)Ma Yinghong, Liu Guizhen, Some results on fractional k-extendable graphs, Chinese Journal of Engineering Mathematics 21(4)(2004), 567-573. (EI)Yan Jin, Liu Guizhen, Vertex-disjoint quadrilaterals in bipartite graphs, J. Systems Science and complexing17(4) (2004), 532-537.Bian qiuju, Liu Guizhen, (g,f)-factors with special properties in bipartite (mg,mf)-graphs, Appl. Math. J. Chinese Univ. Ser B 19(2) (2004)133-139.Diao Kefeng, Liu Guizhen, Upper bounds on minimum number of C-edgesod 4-uniform C-hypergraphs, Mathematica Applicata 17 (4) (2004), 623-628.Liu Guizhen, Feng Haodi, Yu Jiguo, 2-factors with some properties in 2d-regular graphs, Proceedings of the international conference on Mathematical programming, Shanghai University press (2004),251-258. (ISTP)Yan Jin, Liu Guizhen, A new result on independent large cycles in bipartite graphs, Proceedings of the international conference on Mathematical programming, Shanghai University press (2004), 400-404. (ISTP)Song Huimin, Liu Guizhen, Aplications of an equitable edge-coloring theorems, Proceedings of the international conference on Mathematical programming, Shanghai University press (2004), 350-355. (ISTP)Feng Li, Liu Guizhen, Edge disjoint graphs in (mg+k-1,mf-k+1)-graphs, Proceedings of the international conference on Mathematical programming, Shanghai University presof the international conference on Mathematical programming, Shanghai University press (2004), 163-169. (ISTP)Guizhen Liu, Binhai Zhu, Some problems on factorizations with constrains in bipartite graphs, Discrete Applied Math. 128 (2003), 421-434. (SCI)Yu Jiguo, Liu Guizhen, (g,f)-factors in bipartite (mg,mf)-graphs, Mathematica Applicata 16(1) (2003), 126-129.Guizhen Liu et al., A PTAS for minimizing total completion time of bounded batch scheduling, LNCS 2337(2002), 304-314. (SCI, ISTP)H. Feng and Guizhen Liu, Orthogonal factorizations of graphs, J. Graph Theory 40(4) (2002), 267-278. (SCI)Yan Liu, Guizhen Liu, The fractional matching numbers of graphs, Networks 40(3) (2002), 228-231. (SCI)Liu Guizhen, Long Heping, Randomly orthogonal (g,f)-factorizations in graphs, Acta. Appl, Math. Sinica, English Ser. (2002). 18(3), 489-494.Miao Lianying, Liu Guizhen, Edge covered coloring and fractional edge covered coloring, J. of Systems . Science. and complexing (2002).15(2), 187-193.Wu Jianliang and Liu guizhen, The linear arboricity of composition graphs, J. Sys. Sci. and Com. (2002). 15(4), 372-375.Guizhen Liu and Q. Yu, Generalization of matching extensions in graphs, Discrete Math. 213 (2001), 231,311-320. (SCI)Liu Guizhen, Zhang Lanju, Fractional (g,f)-factors of graphs, Acta. Math. Scientia 21B(4) (2001), 541-545. (SCI)Liu Guizhen, Dong Henian, Orthogonal (g,f)-factorizations of bipartite graphs, Acta Math. Scientia 21B(3) (2001), 316-322. (SCI)G. Li, Guizhen Liu, A generalization of orthogonal Factorizations in graphs, Acta Mathematica Sinica, English Series 17(4) (2001), 669-678. (SCI)Yan Xiaoxia, Liu Guizhen, Edge disjoint (g,f)-factors orthogonal to r disjoint subgraphs in (mg+k,mf-k)-graphs, Mathematica Applicata, 2001,14(4) 37-41.P. C. B. Lam, Guizhen Liu et al., Orthogonal (g,f)-factorizations in networks, Networks 35(4) (2000), 285-287. (SCI)Liu Guizhen, On (g, f)-uniform graphs, Advance in Mathematics 29(3), (2000)，285-287.Liu Guizhen and Zhang Lanju, Maximum fractional (0, f)-factors of graphs, Mathematica Applicata,(2000),13(1),31-35.Guizhen Liu, Q. Yu, k-factors and extendability with prescribed components, congr. Numer. (1999)，139，77-88 (ISTP).L.Miao, G.Liu, An extension of one theoremn of critical edge-chromatic graphs, Mathematica Applicata,1999,12(3), 69-71.Guizhen Liu, Q. Yu, Toughness and perfect matchings in graphs, Ars combinatoria, (1998), 41(3), 267-272. (SCI)G. Li and Guizhen Liu, (g,f)-factorizations orthogonal to a subgraph in graphs, Science in China SerA, (1998), 41(3), 267-272. (SCI)L. Xie, Guizhen Liu, B. Xu, On endo-homology of complexs of graphs, Discrete Math., (1998), 188, 285-291. (SCI)Guizhen Liu, Q. Yu, On n-edge-deletable and n-critical graphs, Bulletin of the ICA, (1998), 24, 65-72.Liu Guizhen and Wang Jianfang, (a,b,k)-critical graphs, Advanced in Mathematics,(1998),27(6),536-540.G.liu and J.Wang, (a,b,k)-critical graphs, Chinese Science Bulletin, (1997), 42(17), 1492-1493. (SCI)Li Guojun and Liu Guizhen,(g,f)-factorizations Orthogonal to a subgraph in graphs, Science in China A 40(1997).Li Guojun and Liu Guizhen, Factorization orthogonal to a subgraph in graphs, Advanced in Mathematics,(1997),26(5),464-468.Liu Guizhen, A 2-factorization orthogonal to a star in a graph, J.Sys.Sci and Math.Scis.9:1(1996)38-42.G. Liu and G. Yan, Orthogonal [k-1,k+1]-factorizations in graphs, J. Statistical and inference 51(1996)195-200.(SCI)Liu Guizhen, (g,f)-factorizations orthogonal to a star in graphs, Science in China A38:7(1995)805-812.(SCI)Xie Litong and Liu Guizhen,Combinatorics Graph Theory Algorithms and Applications,World Scientific Publishing Co.(1995)389-397.G. Liu and Q. Yu, Star-factors of vertex-deletion graphs, Congr.Number.107(1995)155-160.Xie Litong and Liu Guizhen,On Whitney's and Tutte's conjecture,Acta Math. Sinica 38:3(1995)289-293.G.Liu, Orthogonal (g,f)-factorizations in graphs.discrete math.143(1995)153-158.(SCI)Liu Guizhen, Some conditions for f-covered graphs, Acta Math.Scientia 14(1994)91-97.Liu Guizhen, (g,f)-factors and factorizations in graphs, Acta Math. Sinica 37:2(1994)230-237.Liu Guizhen, On solutions of Alspach problems, Chinese Science Bulletin 39:7(1994)541-544.(SCI)Liu Guizhen, the Paths between two vertices in tree graphs, J. Sys. Sci and Math. Scis. 5:2(1992)108-110.G. Liu, B. Alspach and K. Heinrich, Some results on orthogonal factorizations in graphs, Advance of Mathematics 21:2(1992)211-215.S. Chen and G. Liu, Toughness of graphs and [a,b]-factors with prescribed properties, JCMCC 12(1992)215-221.Liu Guizhen, Toughness and k-covered graphs, J. Appl. Sciences 15:3(1992)391-402.B.Alspach, K.Heinrich and G.liu ,Orthogonal factorizations of graphs, Contemporary Design Theory:A collection of surveys, John Wiley and sons Inc(1992)13-37.K. Heinrich, P. Hell and G. Liu, A simple existence criterion for (g,f)-factors, Discrete Math, 85(1990)313-317.(SCI)Liu Guizhen, Proof of a conjecture on matroid base graphs, Science in China A 33: 11(1990)1329-1337.(SCI)1990年以前共发表论文36篇，代表作如下B.Alspach and G.Liu, Paths and cycles in Matroid base graphs, graph and Combinatorics 5:3(1989)207-211.(SCI)G. Liu, On [a,b]-covered graphs, JCMCC 5(1989)14-22.Liu Guizhen, Regular k-covered graphs, Acta Math, Scientia9:2(1989)39-43.(SCI)G. Liu, A lower bound on connectivities of matroid base graphs, Discrete Math,69:1(1988)55-60.G. Liu, On connectivities of tree graphs, J.Graph Theory,(1988)12(3),453-459.(SCI)Zheng H. and Liu Guizhen, some properties on Paths in matroid base graphs, J. Sys. Sci. and Math. Sci. 1:2(1988)104-108.K. Heinrich and G. Liu, A lower bound 0n the number of spanning trees with k end vertices, J. Graph Theory 12:1(1988)95-100.G. Liu, On connectivities of base graph of some matroids, J. Sys. Sci. and Math Scis 1:1(1988)18-21.G. Liu, On f-covered graphs, Congr. Number. 61-(1988),81-86.Liu Guizhen, On (g,f)-covered graphs, Acta Math.Scientia,8:2(1988)181-184.(SCI)Liu Guizhen, The connectivities of adjacent tree graphs, Acta Math, Appl.Sinica,3:4(1987)313-317.Liu Guizhen, A theorem on the 1-factors of r-hypertrees, Advance of Mathematics, 15:4(1986)381-383.Liu Guizhen, On the lower bound of Chartrand's problem in simple graphs, J. Appl. Sciences4:4(1986)322-325.Liu Guizhen, Welsh's conjecture is true for simple binary matroids, Kexue Tong bao 30:9(1985)1147-1150.Liu Guizhen, An algorithm for lexicographically generating ordered rooted trees, J. sys. Sci. and math.Scis.5(1985)15-19.Liu Guizhen, A theorem on the 1-factors of (m,n)-trees, Acta Math.Scientia 5:3(1985)267-170.Liu Guizhen, Matroid complexes-geometrical representations on Matroids, Acta Math, Scientia5:1(1985)35-42.Liu Guizhen, A lower bound in solutions of chartrands problem, Acta Math. Appl. Sinica 1:1(1984)93-96.