The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Weifan Wang Wei-Fan Wang ( http://dblp.L3S.de/Authors/Weifan_Wang )

Publication years (Num. hits)
1995-2003 (17) 2004-2007 (18) 2008-2009 (21) 2010-2012 (26) 2013-2014 (20) 2015-2016 (16) 2017-2018 (22) 2019 (4)
Publication types (Num. hits)
article(140) inproceedings(3) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 145 publication records. Showing 144 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ying Wang, Yiqiao Wang 0002, Weifan Wang Star edge-coloring of graphs with maximum degree four. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Yiqiao Wang, Jing Lv, Yanping Yang, Weifan Wang List coloring and diagonal coloring for plane graphs of diameter two. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang 0002 Light structures in 1-planar graphs with an application to linear 2-arboricity. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang 0002 Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wei Gao, Weifan Wang Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Ping Wang, Weifan Wang Strong chromatic index of K4-minor free graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Weifan Wang, Ying Wang Edge-partition and star chromatic index. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, Weiqiang Yu, Weifan Wang On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Xiaoxue Hu, Weifan Wang, Yiqiao Wang 0002, Ping Wang Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jingjing Huo, Wai Chee Shiu, Weifan Wang The neighbor expanded sum distinguishing index of Halin graphs. Search on Bibsonomy Ars Comb. The full citation details ... 2018 DBLP  BibTeX  RDF
1Daiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu Planar graphs without chordal 6-cycles are 4-choosable. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yafang Hu, Weifan Wang 2-distance vertex-distinguishing total coloring of graphs. Search on Bibsonomy Discrete Math., Alg. and Appl. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Min Chen 0012, Weifan Wang A note on the list vertex arboricity of toroidal graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen 0012 Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Search on Bibsonomy Discrete Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jingjing Huo, Weifan Wang, Yiqiao Wang 0002 A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. Search on Bibsonomy Discrete Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang 0002 Planar graphs without chordal 5-cycles are 2-good. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen 0012 2-Distance vertex-distinguishing index of subcubic graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Xiaoxue Hu, Wei-Fan Wang A note on the linear 2-arboricity of planar graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Xiaoxue Hu, Ping Wang, Yiqiao Wang 0002, Weifan Wang The entire chromatic number of graphs embedded on the torus with large maximum degree. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jingjing Huo, Weifan Wang, Chuandong Xu Neighbor Sum Distinguishing Index of Subcubic Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Xiaoxue Hu, Weifan Wang The chromatic number of the square of a Halin graph with maximum degree five is six. Search on Bibsonomy Ars Comb. The full citation details ... 2017 DBLP  BibTeX  RDF
1Jingjing Huo, Yiqiao Wang 0002, Weifan Wang Neighbor-sum-distinguishing edge choosability of subcubic graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, Yingying Fan, Yiqiao Wang 0002, Weifan Wang A sufficient condition for planar graphs to be (3, 1)-choosable. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Qiaojun Shu, Weifan Wang, Yiqiao Wang 0002 A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zixin Li, Ming Lei, Zhe Wang, Weifan Wang, Ping Wang, Yaohua Li A half-capacity back-to-back converter interconnecting synchronous AC grids. Search on Bibsonomy IECON The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Xun Ma, Xu Fei, Zunfang Chu, Zixi Li, Fanqiang Gao, Ming Lei, Zhe Wang, Weifan Wang, Ping Wang, Yaohua Li Full-scale physical control system real-time digital simulator design for MMC-HVDC simulation and testing. Search on Bibsonomy IECON The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Wei-Fan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang 0002 The entire choosability of plane graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tingting Wu, Jiangxu Kong, Wei-Fan Wang The 2-surviving rate of planar graphs without 5-cycles. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang Rainbow cliques in edge-colored graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Danjun Huang, Yanwen Wang, Yiqiao Wang 0002, Ding-Zhu Du A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs. Search on Bibsonomy J. Global Optimization The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, Li Huang, Weifan Wang List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. Search on Bibsonomy Discrete Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Xiaoxue Hu, Weifan Wang, Wai Chee Shiu, Yiqiao Wang 0002 Plane graphs with maximum degree 9 are entirely 11-choosable. Search on Bibsonomy Discrete Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, André Raspaud, Weifan Wang A (3, 1) ∗-choosable theorem on planar graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen 0012 A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Wei-Fan Wang, Danjun Huang A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Fengwei Xu, Wei-Fan Wang, Ko-Wei Lih Full Orientability of the Square of a Cycle. Search on Bibsonomy Ars Comb. The full citation details ... 2015 DBLP  BibTeX  RDF
1Yiqiao Wang 0002, Wei-Fan Wang, Jingjing Huo Some bounds on the neighbor-distinguishing index of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Ko-Wei Lih, Wei-Fan Wang Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. Search on Bibsonomy COCOA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Wei Gao, Weifan Wang The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures. Search on Bibsonomy Comp. Math. Methods in Medicine The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dong Chen 0012, Wai Chee Shiu, Qiaojun Shu, Pak Kiu Sun, Weifan Wang (2, 1)-total labeling of trees with large maximum degree. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hao Gui, Weifan Wang, Yiqiao Wang 0002, Zhao Zhang Equitable total-coloring of subcubic graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Zhengke Miao, Weifan Wang Adjacent vertex distinguishing indices of planar graphs without 3-cycles. Search on Bibsonomy Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Xiaoxue Hu, Wei-Fan Wang Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang Structural properties and surviving rate of planar graphs. Search on Bibsonomy Discrete Math., Alg. and Appl. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang The surviving rate of digraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Stephen Finbow, Jiangxu Kong The 2-surviving rate of planar graphs without 6-cycles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, André Raspaud, Weifan Wang Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Lianzhu Zhang, Weifan Wang, Ko-Wei Lih An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Xiaoxue Hu, Weifan Wang, Yiqiao Wang 0002 The edge-face choosability of plane graphs with maximum degree at least 9. Search on Bibsonomy Discrete Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Stephen Finbow, Ping Wang A lower bound of the surviving rate of a planar graph with girth at least seven. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Chengchao Yan, Danjun Huang, Dong Chen 0012, Weifan Wang Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Danjun Huang The adjacent vertex distinguishing total coloring of planar graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, André Raspaud, Weifan Wang Star list chromatic number of planar subcubic graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mirko Hornák, Danjun Huang, Weifan Wang On Neighbor-Distinguishing Index of Planar Graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Weifan Wang Vertex arboricity of planar graphs without chordal 6-cycles. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Qiaojun Shu, Yiqiao Wang 0002 A new upper bound on the acyclic chromatic indices of planar graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Yiqiao Wang 0002 Linear Coloring of Planar Graphs Without 4-Cycles. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Qiaojun Shu, Weifan Wang The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Qiaojun Shu, Yiqiao Wang 0002, Weifan Wang Acyclic list edge coloring of outerplanar graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Qiaojun Shu, Yiqiao Wang 0002 Acyclic edge coloring of planar graphs without 4-cycles. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, André Raspaud, Weifan Wang 6-Star-Coloring of Subcubic Graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Qiaojun Shu, Weifan Wang, Yiqiao Wang 0002 Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Weifan Wang Planar Graphs of Maximum Degree Six without 7-cycles are Class One. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2012 DBLP  BibTeX  RDF
1Min Chen 0012, André Raspaud, Weifan Wang Vertex-arboricity of planar graphs without intersecting triangles. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Jiangxu Kong, Lianzhu Zhang The 2-surviving rate of planar graphs without 4-cycles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jiangxu Kong, Weifan Wang, Xuding Zhu The surviving rate of planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Qiaojun Shu, Yiqiao Wang 0002 Every 4-regular graph is acyclically edge-6-colorable Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Caiyue Ye, Meijie Ma, Weifan Wang Fault tolerant path-embedding in locally twisted cubes. Search on Bibsonomy Ars Comb. The full citation details ... 2012 DBLP  BibTeX  RDF
1Danjun Huang, Weifan Wang, Jianxing Yin A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Search on Bibsonomy Ars Comb. The full citation details ... 2012 DBLP  BibTeX  RDF
1Qiaojun Shu, Weifan Wang, Yiqiao Wang 0002 Acyclic edge coloring of planar graphs without 5-cycles. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Stephen Finbow, Ping Wang An improved bound on parity vertex colourings of outerplane graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Wai Chee Shiu, Weifan Wang On the vertex-arboricity of planar graphs without 7-cycles. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Danjun Huang, Weifan Wang, Chengchao Yan A note on the adjacent vertex distinguishing total chromatic number of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud On backbone coloring of graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, Gena Hahn, André Raspaud, Weifan Wang Some results on the injective chromatic number of graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Qiaojun Shu, Weifan Wang Acyclic chromatic indices of planar graphs with girth at least five. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yuehua Bu, Ko-Wei Lih, Weifan Wang Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Min Chen 0012, André Raspaud, Weifan Wang 8-star-choosability of a graph with maximum average degree less than 3. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2011 DBLP  BibTeX  RDF
1Weifan Wang, Xubin Yue, Xuding Zhu The surviving rate of an outerplanar graph for the firefighter problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Yiqiao Wang 0002 Adjacent vertex-distinguishing edge colorings of K4-minor free graphs. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Qiaojun Shu, Kan Wang, Ping Wang Acyclic chromatic indices of planar graphs with large girth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Chao Li, Weifan Wang, André Raspaud Upper bounds on the linear chromatic number of a graph. Search on Bibsonomy Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Xuding Zhu Entire colouring of plane graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Xuding Zhu, Ding-Zhu Du (eds.) Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings Search on Bibsonomy COCOA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Stephen Finbow, Ping Wang The surviving rate of an infected network. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yiqiao Wang 0002, Weifan Wang Adjacent vertex distinguishing total colorings of outerplanar graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Yiqiao Wang 0002 Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Leizhen Cai, Weifan Wang, Xuding Zhu Choosability of toroidal graphs without short cycles. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Lan 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. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang On (d, 1)-total numbers of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jing Huang, Haina Sun, Weifan Wang, Dong Chen 0012 (2, 1)-Total labelling of trees with sparse vertices of maximum degree. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Dong Chen 0012 (2, 1)-Total number of trees with maximum degree three. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leizhen Cai, Weifan Wang The Surviving Rate of a Graph for the Firefighter Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yuehua Bu, Dong Chen 0012, André Raspaud, Weifan Wang Injective coloring of planar graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Huajing 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. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1André Raspaud, Weifan Wang Linear coloring of planar graphs with large girth. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Weifan Wang The edge-face coloring of graphs embedded in a surface of characteristic zero. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yongzhu Chen, Weiyi Zhu, Weifan Wang Edge choosability of planar graphs without 5-cycles with a chord. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang Star coloring of sparse graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Weifan Wang, Min Chen 0012 Planar graphs without 4-cycles are acyclically 6-choosable. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 144 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license