The 2-dipath chromatic number of Halin graphs. - Min Chen 012; Weifan Wang 001 (Inf. Process. Lett., 2006)

On 3-colorable planar graphs without prescribed cycles. - Weifan Wang 001; Min Chen 012 (Discret. Math., 2007)

Three-coloring planar graphs without short cycles. - Min Chen 012; André Raspaud; Weifan Wang 001 (Inf. Process. Lett., 2007)

On 3-colorable planar graphs without cycles of four lengths. - Xiaofang Luo; Min Chen 012; Weifan Wang 001 (Inf. Process. Lett., 2007)

On 3-colorable planar graphs without short cycles. - Min Chen 012; Weifan Wang 001 (Appl. Math. Lett., 2008)

Acyclic 5-choosability of planar graphs without 4-cycles. - Min Chen 012; Weifan Wang 001 (Discret. Math., 2008)

Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. - Min Chen 012; André Raspaud (Electron. Notes Discret. Math., 2009)

Planar graphs without 4-cycles are acyclically 6-choosable. - Weifan Wang 001; Min Chen 012 (J. Graph Theory, 2009)

Acyclic 3-choosability of sparse graphs with girth at least 7. - Oleg V. Borodin; Min Chen 012; Anna O. Ivanova; André Raspaud (Discret. Math., 2010)

On acyclic 4-choosability of planar graphs without short cycles. - Min Chen 012; André Raspaud (Discret. Math., 2010)

Homomorphisms from sparse graphs to the Petersen graph. - Min Chen 012; André Raspaud (Discret. Math., 2010)

Acyclic 4-choosability of planar graphs. - Min Chen 012; André Raspaud; Nicolas Roussel; Xuding Zhu (Discret. Math., 2011)

8-star-choosability of a graph with maximum average degree less than 3. - Min Chen 012; André Raspaud; Weifan Wang 001 (Discret. Math. Theor. Comput. Sci., 2011)

Some structural properties of planar graphs and their applications to 3-choosability. - Min Chen 012; Mickaël Montassier; André Raspaud (Discret. Math., 2012)

Vertex-arboricity of planar graphs without intersecting triangles. - Min Chen 012; André Raspaud; Weifan Wang 001 (Eur. J. Comb., 2012)

Some results on the injective chromatic number of graphs. - Min Chen 012; Gena Hahn; André Raspaud; Weifan Wang 001 (J. Comb. Optim., 2012)

A sufficient condition for planar graphs to be acyclically 5-choosable. - Min Chen 012; André Raspaud (J. Graph Theory, 2012)

Planar graphs without 4- and 5-cycles are acyclically 4-choosable. - Min Chen 012; André Raspaud (Discret. Appl. Math., 2013)

(3, 1)*-choosability of planar graphs without adjacent short cycles. - Min Chen 012; André Raspaud (Electron. Notes Discret. Math., 2013)

6-Star-Coloring of Subcubic Graphs. - Min Chen 012; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2013)

On (3, 2)*-choosability of planar graphs without adjacent short cycles. - Min Chen 012; André Raspaud (Discret. Appl. Math., 2014)

Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. - Min Chen 012; André Raspaud; Weifan Wang 001 (Graphs Comb., 2014)

Star list chromatic number of planar subcubic graphs. - Min Chen 012; André Raspaud; Weifan Wang 001 (J. Comb. Optim., 2014)

List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. - Min Chen 012; Li Huang; Weifan Wang 001 (Discret. Math., 2016)

Planar graphs without 4-cycles adjacent to triangles are 4-choosable. - Panpan Cheng; Min Chen 012; Yingqian Wang 001 (Discret. Math., 2016)

Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. - Chuanni Zhang; Yingqian Wang 001; Min Chen 012 (Discret. Math., 2016)

A (3, 1) ∗-choosable theorem on planar graphs. - Min Chen 012; André Raspaud; Weifan Wang 001 (J. Comb. Optim., 2016)

A sufficient condition for planar graphs to be (3, 1)-choosable. - Min Chen 012; Yingying Fan; Yiqiao Wang 002; Weifan Wang 001 (J. Comb. Optim., 2017)

A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable. - Miao Zhang; Min Chen 012; Yiqiao Wang 002 (J. Comb. Optim., 2017)

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. - Min Chen 012; Seog-Jin Kim; Alexandr V. Kostochka; Douglas B. West; Xuding Zhu (J. Comb. Theory B, 2017)

On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. - Min Chen 012; Weiqiang Yu; Weifan Wang 001 (Appl. Math. Comput., 2018)

A note on the list vertex arboricity of toroidal graphs. - Yiqiao Wang 002; Min Chen 012; Weifan Wang 001 (Discret. Math., 2018)

Planar graphs with maximum degree 4 are strongly 19-edge-colorable. - Ying Wang; Wai Chee Shiu; Weifan Wang 001; Min Chen 012 (Discret. Math., 2018)

Acyclic 4-choosability of planar graphs without intersecting short cycles. - Yingcai Sun; Min Chen 012; Dong Chen 012 (Discret. Math. Algorithms Appl., 2018)

2-Distance vertex-distinguishing index of subcubic graphs. - Victor Loumngam Kamga; Weifan Wang 001; Ying Wang; Min Chen 012 (J. Comb. Optim., 2018)

Acyclic improper choosability of subcubic graphs. - Min Chen 012; André Raspaud (Appl. Math. Comput., 2019)

(1, 0)-Relaxed strong edge list coloring of planar graphs with girth 6. - Kai Lin; Min Chen 012; Dong Chen 012 (Discret. Math. Algorithms Appl., 2019)

Edge-Face List Coloring of Halin Graphs. - Xin Jin; Min Chen 012; Xinhong Pang; Jingjing Huo (AAIM, 2020)

Choosability with separation of planar graphs without prescribed cycles. - Min Chen 012; Yingying Fan; André Raspaud; Wai Chee Shiu; Weifan Wang 001 (Appl. Math. Comput., 2020)

A note on strong edge choosability of toroidal subcubic graphs. - Xinhong Pang; Jingjing Huo; Min Chen 012; Weifan Wang 001 (Australas. J Comb., 2021)

Vertex-arboricity of toroidal graphs without K5- and 6-cycles. - Aina Zhu; Dong Chen 012; Min Chen 012; Weifan Wang 001 (Discret. Appl. Math., 2022)

An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6. - Min Chen 012; André Raspaud; Weiqiang Yu (J. Graph Theory, 2022)

An (F3, F5)-partition of planar graphs with girth at least 5. - Min Chen 012; André Raspaud; Weifan Wang 001; Weiqiang Yu (Discret. Math., 2023)

2-Distance choosability of planar graphs with a restriction for maximum degree. - Jiahao Yu; Min Chen 012; Weifan Wang 001 (Appl. Math. Comput., 2023)

A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable. - Ganchao Zhang; Min Chen 012; Weifan Wang 001 (Appl. Math. Comput., 2024)