default search action
Min Chen 0012
Person information
- affiliation: Zhejiang Normal University, Department of Mathematics, Jinhua, China
Other persons with the same name
- Min Chen — disambiguation page
- Min Chen 0001
— University of Oxford, e-Research Center, UK (and 1 more)
- Min Chen 0002
- Min Chen 0003
- Min Chen 0004
- Min Chen 0005
- Min Chen 0006
- Min Chen 0007
- Min Chen 0008
- Min Chen 0009
- Min Chen 0010 — AT&T Labs - Research, Florham Park, NJ, USA
- Min Chen 0011 — Multicoreware (and 1 more)
- Min Chen 0013
- Min Chen 0014
- Min Chen 0015
- Min Chen 0016
- Min Chen 0017 — Pennsylvania State University, Department of Electrical Engineering, University Park, PA, USA
- Min Chen 0018
- Min Chen 0019 — Purdue University, Department of Mathematics, West Lafayette, IN, USA
- Min Chen 0020
- Min Chen 0021 — Tongji University, School of Electronics and Information Engineering, Shanghai, China
- Min Chen 0022 — China Meteorological Administration, Institute of Urban Meteorology, Beijing, China
- Min Chen 0023
- Min Chen 0024 — Texas Instruments, TDI, Dallas, TX, USA (and 1 more)
- Min Chen 0025
- Min Chen 0026
- Min Chen 0027
- Min Chen 0028
- Min Chen 0029
- Min Chen 0030
- Min Chen 0031
- Min Chen 0032
- Min Chen 0033
- Min Chen 0034
- Min Chen 0035 — Concordia University, Department of Computer Science and Software Engineering, Montreal, Canada
- Min Chen 0036 — Fudan University, State key Laboratory of ASIC and System, School of Microelectronics, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j42]Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu:
An (F3, F5)-partition of planar graphs with girth at least 5. Discret. Math. 346(2): 113216 (2023) - 2022
- [j41]Aina Zhu, Dong Chen, Min Chen, Weifan Wang:
Vertex-arboricity of toroidal graphs without K5- and 6-cycles. Discret. Appl. Math. 310: 97-108 (2022) - [j40]Min Chen
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6. J. Graph Theory 99(2): 186-206 (2022) - 2021
- [j39]Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang:
A note on strong edge choosability of toroidal subcubic graphs. Australas. J Comb. 79: 284-294 (2021) - 2020
- [j38]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) - [c1]Xin Jin, Min Chen
Edge-Face List Coloring of Halin Graphs. AAIM 2020: 481-491
2010 – 2019
- 2019
- [j37]Min Chen, André Raspaud:
Acyclic improper choosability of subcubic graphs. Appl. Math. Comput. 356: 92-98 (2019) - [j36]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): 1950064:1-1950064:11 (2019) - 2018
- [j35]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: 117-123 (2018) - [j34]Ying Wang, Wai Chee Shiu
Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discret. Math. 341(6): 1629-1635 (2018) - [j33]Yiqiao Wang, Min Chen, Weifan Wang:
A note on the list vertex arboricity of toroidal graphs. Discret. Math. 341(12): 3344-3347 (2018) - [j32]Yingcai Sun, Min Chen, Dong Chen:
Acyclic 4-choosability of planar graphs without intersecting short cycles. Discret. Math. Algorithms Appl. 10(1): 1850014:1-1850014:11 (2018) - [j31]Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen:
2-Distance vertex-distinguishing index of subcubic graphs. J. Comb. Optim. 36(1): 108-120 (2018) - 2017
- [j30]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): 847-865 (2017) - [j29]Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang:
A sufficient condition for planar graphs to be (3, 1)-choosable. J. Comb. Optim. 34(4): 987-1011 (2017) - [j28]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 B 122: 741-756 (2017) - 2016
- [j27]Min Chen, Li Huang, Weifan Wang:
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. Discret. Math. 339(10): 2526-2535 (2016) - [j26]Chuanni Zhang, Yingqian Wang
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. Discret. Math. 339(12): 3032-3042 (2016) - [j25]Panpan Cheng, Min Chen, Yingqian Wang
Planar graphs without 4-cycles adjacent to triangles are 4-choosable. Discret. Math. 339(12): 3052-3057 (2016) - [j24]Min Chen, André Raspaud, Weifan Wang:
A (3, 1) ∗-choosable theorem on planar graphs. J. Comb. Optim. 32(3): 927-940 (2016) - 2014
- [j23]Min Chen, André Raspaud:
On (3, 2)*-choosability of planar graphs without adjacent short cycles. Discret. Appl. Math. 162: 159-166 (2014) - [j22]Min Chen, André Raspaud, Weifan Wang:
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. Graphs Comb. 30(4): 861-874 (2014) - [j21]Min Chen, André Raspaud, Weifan Wang:
Star list chromatic number of planar subcubic graphs. J. Comb. Optim. 27(3): 440-450 (2014) - 2013
- [j20]Min Chen, André Raspaud:
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. Discret. Appl. Math. 161(7-8): 921-931 (2013) - [j19]Min Chen, André Raspaud:
(3, 1)*-choosability of planar graphs without adjacent short cycles. Electron. Notes Discret. Math. 43: 221-226 (2013) - [j18]Min Chen, André Raspaud, Weifan Wang:
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72(2): 128-145 (2013) - 2012
- [j17]Min Chen, Mickaël Montassier, André Raspaud:
Some structural properties of planar graphs and their applications to 3-choosability. Discret. Math. 312(2): 362-373 (2012) - [j16]Min Chen, André Raspaud, Weifan Wang:
Vertex-arboricity of planar graphs without intersecting triangles. Eur. J. Comb. 33(5): 905-923 (2012) - [j15]Min Chen, Gena Hahn, André Raspaud, Weifan Wang:
Some results on the injective chromatic number of graphs. J. Comb. Optim. 24(3): 299-318 (2012) - [j14]Min Chen, André Raspaud:
A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70(2): 135-151 (2012) - 2011
- [j13]Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu:
Acyclic 4-choosability of planar graphs. Discret. Math. 311(1): 92-101 (2011) - [j12]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): 97-110 (2011) - 2010
- [j11]Min Chen, André Raspaud:
On acyclic 4-choosability of planar graphs without short cycles. Discret. Math. 310(15-16): 2113-2118 (2010) - [j10]Oleg V. Borodin, Min Chen, Anna O. Ivanova
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310(17-18): 2426-2434 (2010) - [j9]Min Chen, André Raspaud:
Homomorphisms from sparse graphs to the Petersen graph. Discret. Math. 310(20): 2705-2713 (2010)
2000 – 2009
- 2009
- [j8]Min Chen, André Raspaud:
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable. Electron. Notes Discret. Math. 34: 659-667 (2009) - [j7]Weifan Wang, Min Chen:
Planar graphs without 4-cycles are acyclically 6-choosable. J. Graph Theory 61(4): 307-323 (2009) - 2008
- [j6]Min Chen, Weifan Wang:
On 3-colorable planar graphs without short cycles. Appl. Math. Lett. 21(9): 961-965 (2008) - [j5]Min Chen, Weifan Wang:
Acyclic 5-choosability of planar graphs without 4-cycles. Discret. Math. 308(24): 6216-6225 (2008) - 2007
- [j4]Weifan Wang, Min Chen:
On 3-colorable planar graphs without prescribed cycles. Discret. Math. 307(22): 2820-2825 (2007) - [j3]Min Chen, André Raspaud, Weifan Wang:
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007) - [j2]Xiaofang Luo, Min Chen, Weifan Wang:
On 3-colorable planar graphs without cycles of four lengths. Inf. Process. Lett. 103(4): 150-156 (2007) - 2006
- [j1]Min Chen, Weifan Wang:
The 2-dipath chromatic number of Halin graphs. Inf. Process. Lett. 99(2): 47-53 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: