default search action
Dong Chen 0012
Person information
- affiliation: Zhejiang Normal University, Department of Mathematics, Jinhua, China
Other persons with the same name
- Dong Chen — disambiguation page
- Dong Chen 0001 — University of Maryland, Department of Physics and Astronomy, Institute for Advanced Computer Studies, College Park, MD, USA
- Dong Chen 0002
— University of Maryland, Department of Geographical Sciences, College Park, MD, USA
- Dong Chen 0003
- Dong Chen 0004
- Dong Chen 0005 — IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA
- Dong Chen 0006 — Chinese Academy of Sciences, Institute of Software, Beijing, China
- Dong Chen 0007 — Nanjing University, Jiangsu Provincial Key Laboratory of Geographic Information Science and Technology / School of Geographic and Oceanographic Sciences, China
- Dong Chen 0008
- Dong Chen 0009
- Dong Chen 0010 — Florida International University, School of Computing and Information Sciences, Miami, FL, USA (and 2 more)
- Dong Chen 0011 — Siemens, Corporate Technology, Munich, Germany (and 1 more)
- Dong Chen 0013
- Dong Chen 0014
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]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)
2010 – 2019
- 2019
- [j9]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
- [j8]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) - 2016
- [j7]Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen:
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. J. Comb. Optim. 31(2): 893-901 (2016) - 2015
- [j6]Dong Chen, Wai Chee Shiu
(2, 1)-total labeling of trees with large maximum degree. Discret. Appl. Math. 187: 61-69 (2015) - 2014
- [j5]Chengchao Yan, Danjun Huang, Dong Chen, Weifan Wang:
Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. J. Comb. Optim. 28(4): 893-909 (2014)
2000 – 2009
- 2009
- [j4]Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang:
Injective coloring of planar graphs. Discret. Appl. Math. 157(4): 663-672 (2009) - [j3]Jing Huang, Haina Sun, Weifan Wang, Dong Chen:
(2, 1)-Total labelling of trees with sparse vertices of maximum degree. Inf. Process. Lett. 109(3): 199-203 (2009) - [j2]Weifan Wang, Dong Chen:
(2, 1)-Total number of trees with maximum degree three. Inf. Process. Lett. 109(14): 805-810 (2009) - 2007
- [j1]Dong Chen, Weifan Wang:
(2, 1)-Total labelling of outerplanar graphs. Discret. Appl. Math. 155(18): 2585-2593 (2007)
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 19:27 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: