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
[2]
Hilfe
Suche: Author="Fan, Genghua"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Forbidden subgraphs and 3-colorings
Genghua Fan
,
Baogang Xu
,
Tianjun Ye
,
Xingxing Yu
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1226-1256
Relative length of longest paths and cycles in 2-connected graphs
Genghua Fan
,
Naidan Ji
SIAM Journal on Discrete Mathematics
23
(3), 2009, pp. 1238-1248
Nowhere-zero 3-flows in triangularly connected graphs
Genghua Fan
,
Hongjian Lai
,
Rui Xu
,
Cun-Quan Zhang
,
Chuixiang Zhou
Journal of Combinatorial Theory Series B
98
(6), 2008, pp. 1325-1336
Ore condition and nowhere-zero 3-flows
Genghua Fan
,
Chuixiang Zhou
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 288-294
Path decompositions and Gallai's conjecture
Genghua Fan
Journal of Combinatorial Theory Series B
93
(2), 2005, pp. 117-125
Cycles in 2-connected graphs
Genghua Fan
,
Xuezheng Lv
,
Pei Wang
Journal of Combinatorial Theory Series B
92
(2), 2004, pp. 379-394
Circular chromatic number and Mycielski graphs
Genghua Fan
Combinatorica
24
(1), 2004, pp. 127-135
Covers of Eulerian graphs
Genghua Fan
Journal of Combinatorial Theory Series B
89
(2), 2003, pp. 173-187
Subgraph coverings and edge switchings
Genghua Fan
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 54-83
Distribution of cycle lengths in graphs
Genghua Fan
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 187-202
Circuit decompositions of Eulerian graphs
Genghua Fan
,
Cun-Quan Zhang
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 1-23
Proofs of two minimum circuit cover conjectures
Genghua Fan
Journal of Combinatorial Theory Series B
74
(2), 1998, pp. 353-367
Extensions of flow theorems
Genghua Fan
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 110-124
Minimum cycle covers of graphs
Genghua Fan
Journal of Graph Theory
25
(3), 1997, pp. 229-242
Hamiltonian square-paths
Genghua Fan
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
67
(2), 1996, pp. 167-182
Paritioning a graph into two square-cycles
Genghua Fan
,
H.A. Kierstead
Journal of Graph Theory
23
(3), 1996, pp. 241-256
The square of paths and cycles
Genghua Fan
,
H.A. Kierstead
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 55-64
Circuit coverings of graphs and a conjecture of Pyber
Genghua Fan
Journal of Combinatorial Theory Series B
65
(1), 1995, pp. 1-6
Path covers of weighted graphs
Genghua Fan
Journal of Graph Theory
19
(1), 1995, pp. 131-136
The square of a Hamiltonian cycle
Genghua Fan
,
Roland Häggkvist
SIAM Journal on Discrete Mathematics
7
(2), 1994, May, pp. 203-212
Fulkerson's conjecture and circuit covers
Genghua Fan
,
André Raspaud
Journal of Combinatorial Theory Series B
61
(1), 1994, pp. 133-138
Short cycle covers of cubic graphs
Genghua Fan
Journal of Graph Theory
18
(2), 1994, pp. 131-141
Tutte's 3-flow conjecture and short cycle covers
Genghua Fan
Journal of Combinatorial Theory Series B
57
(1), 1993, pp. 36-43
Integer flows and cycle covers
Genghua Fan
Journal of Combinatorial Theory Series B
54
, 1992, pp. 113-122
Covering graphs by cycles
Genghua Fan
SIAM Journal on Discrete Mathematics
5
(4), 1992, November, pp. 491-496
Seiten 1
2
>