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="Wang, Weifan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Plane graphs with maximum degree 6 are edge-face 8-colorable
Min Chen
,
André Raspaud
,
Weifan Wang
Graphs and Combinatorics
30
(4), 2014, pp. 861-874
On neighbor-distinguishing index of planar graphs
Mirko Horn̑ák
,
Danjun Huang
,
Weifan Wang
Journal of Graph Theory
76
(4), 2014, pp. 262-278
The 2-surviving rate of planar graphs without 6-cycles
Weifan Wang
,
Stephen Finbow
,
Jiangxu Kong
Theoretical Computer Science
518
, 2014, pp. 22-31
Planar graphs with
\Delta\ge 9
are entirely
(\Delta+2)
-colorable
Yiqiao Wang
,
Xiaoxue Hu
,
Weifan Wang
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 1892-1905
6-star-coloring of subcubic graphs
Min Chen
,
André Raspaud
,
Weifan Wang
Journal of Graph Theory
72
(2), 2013, pp. 128-145
Acyclic chromatic indices of planar graphs with girth at least 4
Qiaojun Shu
,
Weifan Wang
,
Yiqiao Wang
Journal of Graph Theory
73
(4), 2013, pp. 386-399
Linear coloring of planar graphs without 4-cycles
Weifan Wang
,
Yiqiao Wang
Graphs and Combinatorics
29
(4), 2013, pp. 1113-1124
The surviving rate of planar graphs
Jiangxu Kong
,
Weifan Wang
,
Xuding Zhu
Theoretical Computer Science
416
, 2012, pp. 65-70
The 2-surviving rate of planar graphs without 4-cycles
Weifan Wang
,
Jiangxu Kong
,
Lianzhu Zhang
Theoretical Computer Science
457
, 2012, pp. 158-165
The surviving rate of an outerplanar graph for the firefighter problem
Weifan Wang
,
Xubin Yue
,
Xuding Zhu
Theoretical Computer Science
412
(8-10), 2011, pp. 913-921
Entire colouring of plane graphs
Weifan Wang
,
Xuding Zhu
Journal of Combinatorial Theory Series B
101
(6), 2011, pp. 490-501
Choosability of toroidal graphs without short cycles
Leizhen Cai
,
Weifan Wang
,
Xuding Zhu
Journal of Graph Theory
65
(1), 2010, pp. 1-15
The surviving rate of an infected network
Weifan Wang
,
Stephen Finbow
,
Ping Wang
Theoretical Computer Science
411
(40-42), 2010, pp. 3651-3660
Star coloring of sparse graphs
Yuehua Bu
,
Daniel W. Cranston
,
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
Journal of Graph Theory
62
(3), 2009, pp. 201-219
(2,1)-total labelling of trees with sparse vertices of maximum degree
Jing Huang
,
Haina Sun
,
Weifan Wang
,
Dong Chen
Information Processing Letters
109
(3), 2009, pp. 199-203
(2,1)
-total number of trees with maximum degree three
Weifan Wang
,
Dong Chen
Information Processing Letters
109
(14), 2009, pp. 805-810
Planar graphs without 4-cycles are acyclically 6-choosable
Weifan Wang
,
Min Chen
Journal of Graph Theory
61
(4), 2009, pp. 307-323
A relaxation of Havel's 3-color problem
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
,
Yingqian Wang
Information Processing Letters
107
(3-4), 2008, pp. 107-109
Coupled choosability of plane graphs
Weifan Wang
,
Ko-Wei Lih
Journal of Graph Theory
58
(1), 2008, pp. 27-44
Three-coloring planar graphs without short cycles
Min Chen
,
André Raspaud
,
Weifan Wang
Information Processing Letters
101
(3), 2007, pp. 134-138
On 3-colorable planar graphs without cycles of four lengths
Xiaofang Luo
,
Min Chen
,
Weifan Wang
Information Processing Letters
103
(4), 2007, pp. 150-156
Acyclic 5-choosability of planar graphs without small cycles
Mickaël Montassier
,
André Raspaud
,
Weifan Wang
Journal of Graph Theory
54
(3), 2007, pp. 245-260
A sufficient condition for a planar graph to be class 1
Weifan Wang
,
Yongzhu Chen
Theoretical Computer Science
385
(1-3), 2007, pp. 71-77
Total chromatic number of planar graphs with maximum degree ten
Weifan Wang
Journal of Graph Theory
54
(2), 2007, pp. 91-102
Edge-partitions of planar graphs and their game coloring numbers
Wenjie He
,
Xiaoling Hou
,
Ko-Wei Lih
,
Jiating Shao
,
Weifan Wang
,
Xuding Zhu
Journal of Graph Theory
41
(4), 2002, pp. 307-317