Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Liu, Guizhen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fractional
f
-edge cover chromatic index of graphs
Jinbo Li
,
Guizhen Liu
,
Guanghui Wang
Graphs and Combinatorics
30
(3), 2014, pp. 687-698
Total coloring of embedded graphs with maximum degree at least seven
Huijuan Wang
,
Bin Liu
,
Jianliang Wu
,
Guizhen Liu
Theoretical Computer Science
518
, 2014, pp. 1-9
Acyclic edge coloring of planar graphs without small cycles
Jianfeng Hou
,
Guizhen Liu
,
Jianliang Wu
Graphs and Combinatorics
28
(2), 2012, pp. 215-226
A note on heterochromatic
C_4
in edge-colored triangle-free graphs
Guanghui Wang
,
Hao Li
,
Yan Zhu
,
Guizhen Liu
Graphs and Combinatorics
28
(6), 2012, pp. 901-905
Circular coloring of planar digraphs
Guanghui Wang
,
Bin Liu
,
Jiguo Yu
,
Guizhen Liu
Graphs and Combinatorics
28
(6), 2012, pp. 889-900
On edge colorings of 1-planar graphs without adjacent triangles
Xin Zhang
,
Guizhen Liu
Information Processing Letters
112
(4), 2012, pp. 138-142
A note on relaxed equitable coloring of graphs
Hao Fan
,
H.A. Kierstead
,
Guizhen Liu
,
Theodore Molla
,
Jian-Liang Wu
,
Xin Zhang
Information Processing Letters
111
(21-22), 2011, pp. 1062-1066
On edge covering colorings of graphs
Xia Zhang
,
Guizhen Liu
Information Processing Letters
111
(20), 2011, pp. 1004-1006
Equitable edge-colorings of simple graphs
Xia Zhang
,
Guizhen Liu
Journal of Graph Theory
66
(3), 2011, pp. 175-197
Vertex-distinguishing edge colorings of graphs with degree sum conditions
Bin Liu
,
Guizhen Liu
Graphs and Combinatorics
26
(6), 2010, pp. 781-791
Edge-choosability of planar graphs without non-induced 5-cycles
Jiansheng Cai
,
Jianfeng Hou
,
Xia Zhang
,
Guizhen Liu
Information Processing Letters
109
(7), 2009, pp. 343-346
A note on ``The super connectivity of augmented cubes''
Meijie Ma
,
Xuegong Tan
,
Jun-Ming Xu
,
Guizhen Liu
Information Processing Letters
109
(12), 2009, pp. 592-593
Paths, cycles and circular colorings in digraphs
Guanghui Wang
,
Guizhen Liu
Theoretical Computer Science
410
(21-23), 2009, pp. 1982-1985
Acyclic edge coloring of planar graphs with large girth
Dongxiao Yu
,
Jianfeng Hou
,
Guizhen Liu
,
Bin Liu
,
Lan Xu
Theoretical Computer Science
410
(47-49), 2009, pp. 5196-5200
Total colorings of planar graphs without small cycles
Jianfeng Hou
,
Yan Zhu
,
Guizhen Liu
,
Jianliang Wu
,
Mei Lan
Graphs and Combinatorics
24
(2), 2008, pp. 91-100
List edge and list total colorings of planar graphs without short cycles
Bin Liu
,
Jianfeng Hou
,
Guizhen Liu
Information Processing Letters
108
(6), 2008, pp. 347-351
Paths in circuit graphs of matroids
Guizhen Liu
,
Ping Li
Theoretical Computer Science
396
(1-3), 2008, pp. 258-263
The super connectivity of augmented cubes
Meijie Ma
,
Guizhen Liu
,
Jun-Ming Xu
Information Processing Letters
106
(2), 2008, pp. 59-63
Fault-tolerant embedding of paths in crossed cubes
Meijie Ma
,
Guizhen Liu
,
Jun-Ming Xu
Theoretical Computer Science
407
(1-3), 2008, pp. 110-116
Cycles in circuit graphs of matroids
Ping Li
,
Guizhen Liu
Graphs and Combinatorics
23
(4), 2007, pp. 425-431
Some results about
f
-critical graphs
Guizhen Liu
,
Jianfeng Hou
,
Jiansheng Cai
Networks
50
(3), 2007, pp. 197-202
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Meijie Ma
,
Guizhen Liu
,
Jun-Ming Xu
Parallel Computing
33
(1), 2007, pp. 36-42
List edge and list total colorings of planar graphs without 4-cycles
Jianfeng Hou
,
Guizhen Liu
,
Jiansheng Cai
Theoretical Computer Science
369
(1-3), 2006, pp. 250-255
A PTAS for minimizing total completion time of bounded batch scheduling
Mao-Cheng Cai
,
Xiaotie Deng
,
Haodi Feng
,
Guojun Li
,
Guizhen Liu
Lecture Notes in Computer Science
2337
, 2002, pp. 304-314
A PTAS for minimizing total completion time of bounded batch scheduling
Xiaotie Deng
,
Haodi Feng
,
Guojun Li
,
Guizhen Liu
International Journal of Foundations of Computer Science
13
(6), 2002, pp. 817-827
Seiten 1
2
>