| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud |
On backbone coloring of graphs.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiaojun Shu, Weifan Wang |
Acyclic chromatic indices of planar graphs with girth at least five. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiangxu Kong, Weifan Wang, Xuding Zhu |
The surviving rate of planar graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Weifan Wang |
Vertex-arboricity of planar graphs without intersecting triangles. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiaojun Shu, Weifan Wang, Yiqiao Wang 0002 |
Acyclic edge coloring of planar graphs without 5-cycles. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Xuding Zhu |
Entire colouring of plane graphs. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Xubin Yue, Xuding Zhu |
The surviving rate of an outerplanar graph for the firefighter problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Li, Weifan Wang, André Raspaud |
Upper bounds on the linear chromatic number of a graph. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Weifan Wang |
8-star-choosability of a graph with maximum average degree less than 3. |
Discrete Mathematics & Theoretical Computer Science |
2011 |
DBLP BibTeX RDF |
|
| 1 | Weifan Wang, Yiqiao Wang 0002 |
Adjacent vertex-distinguishing edge colorings of K4-minor free graphs. |
Appl. Math. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuehua Bu, Ko-Wei Lih, Weifan Wang |
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. |
Discussiones Mathematicae Graph Theory |
2011 |
DBLP BibTeX RDF |
|
| 1 | Weifan Wang, Qiaojun Shu, Kan Wang, Ping Wang |
Acyclic chromatic indices of planar graphs with large girth. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Xuding Zhu, Ding-Zhu Du (eds.) |
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yiqiao Wang 0002, Weifan Wang |
Adjacent vertex distinguishing total colorings of outerplanar graphs. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Yiqiao Wang 0002 |
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Stephen Finbow, Ping Wang |
The surviving rate of an infected network. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leizhen Cai, Weifan Wang, Xuding Zhu |
Choosability of toroidal graphs without short cycles. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang |
On (d, 1)-total numbers of graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih |
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. |
Appl. Math. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing Huang, Haina Sun, Weifan Wang, Dong Chen |
(2, 1)-Total labelling of trees with sparse vertices of maximum degree. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Dong Chen |
(2, 1)-Total number of trees with maximum degree three. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud |
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang |
The edge-face coloring of graphs embedded in a surface of characteristic zero. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Weifan Wang |
Linear coloring of planar graphs with large girth. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongzhu Chen, Weiyi Zhu, Weifan Wang |
Edge choosability of planar graphs without 5-cycles with a chord. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leizhen Cai, Weifan Wang |
The Surviving Rate of a Graph for the Firefighter Problem. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang |
Star coloring of sparse graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Min Chen |
Planar graphs without 4-cycles are acyclically 6-choosable. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang |
Injective coloring of planar graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
Coupled choosability of plane graphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
Note on Coloring the Square of an Outerplanar Graph. |
Ars Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang |
A relaxation of Havel's 3-color problem. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, Weifan Wang |
Acyclic 5-choosability of planar graphs without 4-cycles. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongzhu Chen, Weifan Wang |
Diameters of uniform subset graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Weifan Wang |
On the vertex-arboricity of planar graphs. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, Weifan Wang |
On 3-colorable planar graphs without short cycles. |
Appl. Math. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongzhu Chen, Weiyi Zhu, Weifan Wang |
Improper choosability of graphs of nonnegative characteristic. |
Computers & Mathematics with Applications |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Leizhen Cai |
Labelling planar graphs without 4-cycles with a condition on distance two. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaofang Luo, Min Chen, Weifan Wang |
On 3-colorable planar graphs without cycles of four lengths. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, André Raspaud, Weifan Wang |
Three-coloring planar graphs without short cycles. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Yongzhu Chen |
A sufficient condition for a planar graph to be class 1. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Min Chen |
On 3-colorable planar graphs without prescribed cycles. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Weifan Wang |
Acyclic 5-choosability of planar graphs without small cycles. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang |
Total chromatic number of planar graphs with maximum degree ten. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dong Chen, Weifan Wang |
(2, 1)-Total labelling of outerplanar graphs. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang |
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang |
The L(2, 1)-labelling of trees. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Yiqiao Wang 0002 |
L(p, q)-labelling of K4-minor free graphs. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chen, Weifan Wang |
The 2-dipath chromatic number of Halin graphs. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, André Raspaud, Weifan Wang |
Bordeaux 3-color conjecture and 3-choosability. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuehua Bu, Weifan Wang |
Some sufficient conditions for a planar graph of maximum degree six to be Class 1. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
List Coloring Halin Graphs. |
Ars Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
The edge-face choosability of plane graphs. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang |
Vertex-pancyclicity of edge-face-total graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang |
The Linear 2-Arboricity of Outerplanar Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Chun-Yen Chou, Wei-Fan Wang, Xuding Zhu |
Relaxed game chromatic number of graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu |
Coloring the square of a K4-minor free graph. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang |
The Linear 2-Arboricity of Planar Graphs. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
Labeling Planar Graphs with Conditions on Girth and Distance Two. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
Choosability and edge choosability of planar graphs without five cycles. |
Appl. Math. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang |
Equitable Total Coloring of Graphs with Maximum Degree 3. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang |
Edge-pancyclicity of coupled graphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Fan Wang, Ko-Wei Lih |
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. |
Eur. J. Comb. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang |
A note on list improper coloring planar graphs. |
Appl. Math. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang |
Upper Bounds of Entire Chromatic Number of Plane Graphs. |
Eur. J. Comb. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang |
On the colorings of outerplanar graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")