Min Chen

According to our database, Min Chen authored at least 43 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

An (<i>F</i>₃, <i>F</i>₅)-partition of planar graphs with girth at least 5.

Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu

Discret. Math., 2023

2022

An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6.

Min Chen, André Raspaud, Weiqiang Yu

J. Graph Theory, 2022

Vertex-arboricity of toroidal graphs without K5- and 6-cycles.

Aina Zhu, Dong Chen, Min Chen, Weifan Wang

Discret. Appl. Math., 2022

2021

A note on strong edge choosability of toroidal subcubic graphs.

Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang

Australas. J Comb., 2021

2020

Choosability with separation of planar graphs without prescribed cycles.

Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu, Weifan Wang

Appl. Math. Comput., 2020

Edge-Face List Coloring of Halin Graphs.

Xin Jin, Min Chen, Xinhong Pang, Jingjing Huo

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

(1, 0)-Relaxed strong edge list coloring of planar graphs with girth 6.

Kai Lin, Min Chen, Dong Chen

Discret. Math. Algorithms Appl., 2019

Acyclic improper choosability of subcubic graphs.

Min Chen, André Raspaud

Appl. Math. Comput., 2019

2018

2-Distance vertex-distinguishing index of subcubic graphs.

Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen

J. Comb. Optim., 2018

Acyclic 4-choosability of planar graphs without intersecting short cycles.

Yingcai Sun, Min Chen, Dong Chen

Discret. Math. Algorithms Appl., 2018

Planar graphs with maximum degree 4 are strongly 19-edge-colorable.

Ying Wang, Wai Chee Shiu, Weifan Wang, Min Chen

Discret. Math., 2018

A note on the list vertex arboricity of toroidal graphs.

Yiqiao Wang, Min Chen, Weifan Wang

Discret. Math., 2018

On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree.

Min Chen, Weiqiang Yu, Weifan Wang

Appl. Math. Comput., 2018

2017

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.

Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu

J. Comb. Theory B, 2017

A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable.

Miao Zhang, Min Chen, Yiqiao Wang

J. Comb. Optim., 2017

A sufficient condition for planar graphs to be (3, 1)-choosable.

Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang

J. Comb. Optim., 2017

2016

A (3, 1) ∗-choosable theorem on planar graphs.

Min Chen, André Raspaud, Weifan Wang

J. Comb. Optim., 2016

Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable.

Chuanni Zhang, Yingqian Wang, Min Chen

Discret. Math., 2016

Planar graphs without 4-cycles adjacent to triangles are 4-choosable.

Panpan Cheng, Min Chen, Yingqian Wang

Discret. Math., 2016

List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles.

Min Chen, Li Huang, Weifan Wang

Discret. Math., 2016

2014

Star list chromatic number of planar subcubic graphs.

Min Chen, André Raspaud, Weifan Wang

J. Comb. Optim., 2014

Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable.

Min Chen, André Raspaud, Weifan Wang

Graphs Comb., 2014

On (3, 2)*-choosability of planar graphs without adjacent short cycles.

Min Chen, André Raspaud

Discret. Appl. Math., 2014

2013

6-Star-Coloring of Subcubic Graphs.

Min Chen, André Raspaud, Weifan Wang

J. Graph Theory, 2013

(3, 1)*-choosability of planar graphs without adjacent short cycles.

Min Chen, André Raspaud

Electron. Notes Discret. Math., 2013

Planar graphs without 4- and 5-cycles are acyclically 4-choosable.

Min Chen, André Raspaud

Discret. Appl. Math., 2013

2012

A sufficient condition for planar graphs to be acyclically 5-choosable.

Min Chen, André Raspaud

J. Graph Theory, 2012

Some results on the injective chromatic number of graphs.

Min Chen, Gena Hahn, André Raspaud, Weifan Wang

J. Comb. Optim., 2012

Vertex-arboricity of planar graphs without intersecting triangles.

Min Chen, André Raspaud, Weifan Wang

Eur. J. Comb., 2012

Some structural properties of planar graphs and their applications to 3-choosability.

Min Chen, Mickaël Montassier, André Raspaud

Discret. Math., 2012

2011

8-star-choosability of a graph with maximum average degree less than 3.

Min Chen, André Raspaud, Weifan Wang

Discret. Math. Theor. Comput. Sci., 2011

Acyclic 4-choosability of planar graphs.

Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu

Discret. Math., 2011

2010

Homomorphisms from sparse graphs to the Petersen graph.

Min Chen, André Raspaud

Discret. Math., 2010

On acyclic 4-choosability of planar graphs without short cycles.

Min Chen, André Raspaud

Discret. Math., 2010

Acyclic 3-choosability of sparse graphs with girth at least 7.

Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud

Discret. Math., 2010

2009

Planar graphs without 4-cycles are acyclically 6-choosable.

Weifan Wang, Min Chen

J. Graph Theory, 2009

Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.

Min Chen, André Raspaud

Electron. Notes Discret. Math., 2009

2008

Acyclic 5-choosability of planar graphs without 4-cycles.

Min Chen, Weifan Wang

Discret. Math., 2008

On 3-colorable planar graphs without short cycles.

Min Chen, Weifan Wang

Appl. Math. Lett., 2008

2007

On 3-colorable planar graphs without cycles of four lengths.

Xiaofang Luo, Min Chen, Weifan Wang

Inf. Process. Lett., 2007

Three-coloring planar graphs without short cycles.

Min Chen, André Raspaud, Weifan Wang

Inf. Process. Lett., 2007

On 3-colorable planar graphs without prescribed cycles.

Weifan Wang, Min Chen

Discret. Math., 2007

2006

The 2-dipath chromatic number of Halin graphs.

Min Chen, Weifan Wang

Inf. Process. Lett., 2006