Min Chen

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 18

Top Topics

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

Appl. Math. Comput.

Publications

Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu
)-partition of planar graphs with girth at least 5. Discret. Math. 346 (2) (2023)
Aina Zhu, Dong Chen, Min Chen, Weifan Wang
Vertex-arboricity of toroidal graphs without K5- and 6-cycles. Discret. Appl. Math. 310 (2022)
Min Chen, André Raspaud, Weiqiang Yu
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6. J. Graph Theory 99 (2) (2022)
Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang
A note on strong edge choosability of toroidal subcubic graphs. Australas. J Comb. 79 (2021)
Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang
Choosability with separation of planar graphs without prescribed cycles. Appl. Math. Comput. 367 (2020)
Xin Jin, Min Chen, Xinhong Pang, Jingjing Huo
Edge-Face List Coloring of Halin Graphs. AAIM (2020)
Min Chen, André Raspaud
Acyclic improper choosability of subcubic graphs. Appl. Math. Comput. 356 (2019)
Kai Lin, Min Chen, Dong Chen
(1, 0)-Relaxed strong edge list coloring of planar graphs with girth 6. Discret. Math. Algorithms Appl. 11 (6) (2019)
Min Chen, Weiqiang Yu, Weifan Wang
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. Appl. Math. Comput. 326 (2018)
Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen
Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discret. Math. 341 (6) (2018)
Yingcai Sun, Min Chen, Dong Chen
Acyclic 4-choosability of planar graphs without intersecting short cycles. Discret. Math. Algorithms Appl. 10 (1) (2018)
Yiqiao Wang, Min Chen, Weifan Wang
A note on the list vertex arboricity of toroidal graphs. Discret. Math. 341 (12) (2018)
Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen
2-Distance vertex-distinguishing index of subcubic graphs. J. Comb. Optim. 36 (1) (2018)
Miao Zhang, Min Chen, Yiqiao Wang
A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable. J. Comb. Optim. 33 (3) (2017)
Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory, Ser. B 122 (2017)
Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang
A sufficient condition for planar graphs to be (3, 1)-choosable. J. Comb. Optim. 34 (4) (2017)
Min Chen, Li Huang, Weifan Wang
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. Discret. Math. 339 (10) (2016)
Min Chen, André Raspaud, Weifan Wang
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32 (3) (2016)
Min Chen, André Raspaud
On (3, 2)*-choosability of planar graphs without adjacent short cycles. Discret. Appl. Math. 162 (2014)
Min Chen, André Raspaud, Weifan Wang
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30 (4) (2014)
Min Chen, André Raspaud, Weifan Wang
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27 (3) (2014)
Min Chen, André Raspaud
(3, 1)*-choosability of planar graphs without adjacent short cycles. Electron. Notes Discret. Math. 43 (2013)
Min Chen, André Raspaud
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discret. Appl. Math. 161 (7-8) (2013)
Min Chen, André Raspaud, Weifan Wang
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72 (2) (2013)
Min Chen, André Raspaud
A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70 (2) (2012)
Min Chen, André Raspaud, Weifan Wang
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33 (5) (2012)
Min Chen, Mickaël Montassier, André Raspaud
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312 (2) (2012)
Min Chen, Gena Hahn, André Raspaud, Weifan Wang
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24 (3) (2012)
Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu
Acyclic 4-choosability of planar graphs. Discret. Math. 311 (1) (2011)
Min Chen, André Raspaud, Weifan Wang
8-star-choosability of a graph with maximum average degree less than 3. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)
Min Chen, André Raspaud
On acyclic 4-choosability of planar graphs without short cycles. Discret. Math. 310 (15-16) (2010)
Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310 (17-18) (2010)
Min Chen, André Raspaud
Homomorphisms from sparse graphs to the Petersen graph. Discret. Math. 310 (20) (2010)
Min Chen, André Raspaud
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electron. Notes Discret. Math. 34 (2009)
Weifan Wang, Min Chen
Planar graphs without 4-cycles are acyclically 6-choosable. J. Graph Theory 61 (4) (2009)
Min Chen, Weifan Wang
On 3-colorable planar graphs without short cycles. Appl. Math. Lett. 21 (9) (2008)
Min Chen, Weifan Wang
Acyclic 5-choosability of planar graphs without 4-cycles. Discret. Math. 308 (24) (2008)
Min Chen, André Raspaud, Weifan Wang
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101 (3) (2007)
Weifan Wang, Min Chen
On 3-colorable planar graphs without prescribed cycles. Discret. Math. 307 (22) (2007)
Xiaofang Luo, Min Chen, Weifan Wang
On 3-colorable planar graphs without cycles of four lengths. Inf. Process. Lett. 103 (4) (2007)
Min Chen, Weifan Wang
The 2-dipath chromatic number of Halin graphs. Inf. Process. Lett. 99 (2) (2006)