Min Chen

47 papers C 1Journal 46
YearRankTypeTitle / Venue / Authors
2026 J jnl
3-IC planar graphs are dynamically 9-choosable.
Appl. Math. Comput.
Wenjuan Wei, Min Chen, Weiqiang Yu
2026 J jnl
A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable.
Discret. Appl. Math.
Ganchao Zhang, Min Chen, Danjun Huang, Weifan Wang
2024 J jnl
A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable.
Appl. Math. Comput.
Ganchao Zhang, Min Chen, Weifan Wang
2023 J jnl
2-Distance choosability of planar graphs with a restriction for maximum degree.
Appl. Math. Comput.
Jiahao Yu, Min Chen, Weifan Wang
2023 J jnl
An (
Discret. Math.
Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu
2022 J jnl
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6.
J. Graph Theory
Min Chen, André Raspaud, Weiqiang Yu
2022 J jnl
Vertex-arboricity of toroidal graphs without K5- and 6-cycles.
Discret. Appl. Math.
Aina Zhu, Dong Chen, Min Chen, Weifan Wang
2021 J jnl
A note on strong edge choosability of toroidal subcubic graphs.
Australas. J Comb.
Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang
2020 J jnl
Choosability with separation of planar graphs without prescribed cycles.
Appl. Math. Comput.
Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang
2020 C conf
Edge-Face List Coloring of Halin Graphs.
AAIM
Xin Jin, Min Chen, Xinhong Pang, Jingjing Huo
2019 J jnl
(1, 0)-Relaxed strong edge list coloring of planar graphs with girth 6.
Discret. Math. Algorithms Appl.
Kai Lin, Min Chen, Dong Chen
2019 J jnl
Acyclic improper choosability of subcubic graphs.
Appl. Math. Comput.
Min Chen, André Raspaud
2018 J jnl
2-Distance vertex-distinguishing index of subcubic graphs.
J. Comb. Optim.
Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen
2018 J jnl
A note on the list vertex arboricity of toroidal graphs.
Discret. Math.
Yiqiao Wang, Min Chen, Weifan Wang
2018 J jnl
Acyclic 4-choosability of planar graphs without intersecting short cycles.
Discret. Math. Algorithms Appl.
Yingcai Sun, Min Chen, Dong Chen
2018 J jnl
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.
Appl. Math. Comput.
Min Chen, Weiqiang Yu, Weifan Wang
2018 J jnl
Planar graphs with maximum degree 4 are strongly 19-edge-colorable.
Discret. Math.
Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen
2017 J jnl
A sufficient condition for planar graphs to be (3, 1)-choosable.
J. Comb. Optim.
Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang
2017 J jnl
A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable.
J. Comb. Optim.
Miao Zhang, Min Chen, Yiqiao Wang
2017 J jnl
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory B
Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu
2016 J jnl
A (3, 1) ∗-choosable theorem on planar graphs.
J. Comb. Optim.
Min Chen, André Raspaud, Weifan Wang
2016 J jnl
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles.
Discret. Math.
Min Chen, Li Huang, Weifan Wang
2016 J jnl
Planar graphs without 4-cycles adjacent to triangles are 4-choosable.
Discret. Math.
Panpan Cheng, Min Chen, Yingqian Wang
2016 J jnl
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable.
Discret. Math.
Chuanni Zhang, Yingqian Wang, Min Chen
2014 J jnl
On (3, 2)*-choosability of planar graphs without adjacent short cycles.
Discret. Appl. Math.
Min Chen, André Raspaud
2014 J jnl
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.
Graphs Comb.
Min Chen, André Raspaud, Weifan Wang
2014 J jnl
Star list chromatic number of planar subcubic graphs.
J. Comb. Optim.
Min Chen, André Raspaud, Weifan Wang
2013 J jnl
(3, 1)*-choosability of planar graphs without adjacent short cycles.
Electron. Notes Discret. Math.
Min Chen, André Raspaud
2013 J jnl
6-Star-Coloring of Subcubic Graphs.
J. Graph Theory
Min Chen, André Raspaud, Weifan Wang
2013 J jnl
Planar graphs without 4- and 5-cycles are acyclically 4-choosable.
Discret. Appl. Math.
Min Chen, André Raspaud
2012 J jnl
A sufficient condition for planar graphs to be acyclically 5-choosable.
J. Graph Theory
Min Chen, André Raspaud
2012 J jnl
Some results on the injective chromatic number of graphs.
J. Comb. Optim.
Min Chen, Gena Hahn, André Raspaud, Weifan Wang
2012 J jnl
Some structural properties of planar graphs and their applications to 3-choosability.
Discret. Math.
Min Chen, Mickaël Montassier, André Raspaud
2012 J jnl
Vertex-arboricity of planar graphs without intersecting triangles.
Eur. J. Comb.
Min Chen, André Raspaud, Weifan Wang
2011 J jnl
8-star-choosability of a graph with maximum average degree less than 3.
Discret. Math. Theor. Comput. Sci.
Min Chen, André Raspaud, Weifan Wang
2011 J jnl
Acyclic 4-choosability of planar graphs.
Discret. Math.
Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu
2010 J jnl
Acyclic 3-choosability of sparse graphs with girth at least 7.
Discret. Math.
Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud
2010 J jnl
Homomorphisms from sparse graphs to the Petersen graph.
Discret. Math.
Min Chen, André Raspaud
2010 J jnl
On acyclic 4-choosability of planar graphs without short cycles.
Discret. Math.
Min Chen, André Raspaud
2009 J jnl
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.
Electron. Notes Discret. Math.
Min Chen, André Raspaud
2009 J jnl
Planar graphs without 4-cycles are acyclically 6-choosable.
J. Graph Theory
Weifan Wang, Min Chen
2008 J jnl
Acyclic 5-choosability of planar graphs without 4-cycles.
Discret. Math.
Min Chen, Weifan Wang
2008 J jnl
On 3-colorable planar graphs without short cycles.
Appl. Math. Lett.
Min Chen, Weifan Wang
2007 J jnl
On 3-colorable planar graphs without cycles of four lengths.
Inf. Process. Lett.
Xiaofang Luo, Min Chen, Weifan Wang
2007 J jnl
On 3-colorable planar graphs without prescribed cycles.
Discret. Math.
Weifan Wang, Min Chen
2007 J jnl
Three-coloring planar graphs without short cycles.
Inf. Process. Lett.
Min Chen, André Raspaud, Weifan Wang
2006 J jnl
The 2-dipath chromatic number of Halin graphs.
Inf. Process. Lett.
Min Chen, Weifan Wang