default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRong Chen 0002
Person information
- affiliation: Fuzhou University, Center for Discrete Mathematics, China
- affiliation (2007 - 2010): Nankai University, Center for Combinatorics, Tianjin, China
Other persons with the same name
- Rong Chen — disambiguation page
- Rong Chen 0001
![[0000-0002-6115-8130]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6115-8130")
— Shanghai Jiao Tong University, Institute of Parallel and Distributed Systems, China (and 1 more) - Rong Chen 0003 — Dalian Maritime University, Department of Information Science and Technology, China
- Rong Chen 0004 — Southwest Jiaotong University, MOE Key Laboratory of High-Speed Railway Engineering, Chengdu, China
- Rong Chen 0005 — University of Maryland School of Medicine, Department of Diagnostic Radiology and Nuclear Medicine, Baltimore, MD, USA (and 1 more)
- Rong Chen 0006 — Stanford University School of Medicine, Stanford, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Rong Chen:
The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids. SIAM J. Discret. Math. 36(3): 1627-1644 (2022)
2010 – 2019
- 2018
- [j11]Rong Chen, Irene Pivotto:
Biased graphs with no two vertex-disjoint unbalanced cycles. J. Comb. Theory B 130: 207-245 (2018) - [j10]Rong Chen, Jim Geelen:
Infinitely many excluded minors for frame matroids and for lifted-graphic matroids. J. Comb. Theory B 133: 46-53 (2018) - [j9]Rong Chen, Geoff Whittle:
On Recognizing Frame and Lifted-Graphic Matroids. J. Graph Theory 87(1): 72-76 (2018) - 2017
- [j8]Rong Chen:
The excluded minors for the class of matroids that are graphic or bicircular lift. Adv. Appl. Math. 83: 97-114 (2017) - 2015
- [j7]Rong Chen, Matt DeVos, Daryl Funk, Irene Pivotto:
Graphical Representations of Graphic Frame Matroids. Graphs Comb. 31(6): 2075-2086 (2015) - 2014
- [j6]Rong Chen:
The structure of 4-flowers of vertically 4-connected matroids. Adv. Appl. Math. 58: 37-62 (2014) - [j5]Rong Chen, Geoff Whittle:
Intertwining Connectivity in Matroids. SIAM J. Discret. Math. 28(3): 1402-1404 (2014) - 2013
- [j4]Rong Chen:
Crossing 3-separations in 3-connected matroids. Discret. Math. 313(5): 677-688 (2013) - 2012
- [j3]Rong Chen, Kai-Nan Xiang:
Decomposition of 3-connected representable matroids. J. Comb. Theory B 102(3): 647-670 (2012) - 2010
- [j2]Joseph E. Bonin, Rong Chen, Kai-Nan Xiang:
Amalgams of extremal matroids with no U2, l+2-minor. Discret. Math. 310(17-18): 2317-2322 (2010)
2000 – 2009
- 2009
- [j1]Rong Chen, Kai-Nan Xiang:
A Note on Totally Free Matroids. Graphs Comb. 25(5): 657-673 (2009)
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-10-23 21:23 CEST 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:
