Ming Chen

Orcid: 0000-0001-8066-2669

Affiliations:

Jiaxing University, College of Mathematics Physics and Information Engineering, Jiaxing, China
Tongji University, School of Mathematical Sciences, Shanghai, China

According to our database¹, Ming Chen authored at least 8 papers between 2008 and 2021.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2021

Linear list coloring of some sparse graph.

[BibT_eX]

[DOI]

Ming Chen

Yusheng Li

Li Zhang

Discuss. Math. Graph Theory, 2021

2019

Independence and matching number of some graphs.

[BibT_eX]

[DOI]

Ming Chen

Yusheng Li

Yiting Yang

J. Comb. Optim., 2019

2018

Ramsey Good Graphs with Long Suspended Paths.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Gallai-Ramsey Numbers of Odd Cycles and Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Ming Chen

Yusheng Li

Chaoping Pei

Graphs Comb., 2018

2016

Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable.

[BibT_eX]

[DOI]

Discret. Math., 2016

2010

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable.

[BibT_eX]

[DOI]

Yingqian Wang

Huajing Lu

Ming Chen

Discret. Math., 2010

2008

A note on 3-choosability of planar graphs.

[BibT_eX]

[DOI]

Yingqian Wang

Huajing Lu

Ming Chen

Inf. Process. Lett., 2008

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable.

[BibT_eX]

[DOI]

Yingqian Wang

Ming Chen

Liang Shen

Discret. Math., 2008

Ming Chen

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...