![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Dong Ye 0002
Person information
- affiliation: Middle Tennessee State University, Murfreesboro, TN, USA
Other persons with the same name
- Dong Ye — disambiguation page
- Dong Ye 0001 — University of Metz, France
- Dong Ye 0003
— Harbin Institute of Technology, School of Electrical Engineering and Automation, China
- Dong Ye 0004 — Northeastern University, Boston, MA, USA
- Dong Ye 0005
— Harbin Institute of Technology, Research Center of Satellite Technology, China
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j35]Niko Tratnik, Dong Ye
:
Resonance Graphs on Perfect Matchings of Graphs on Surfaces. Graphs Comb. 39(4): 68 (2023) - [j34]Naidan Ji, Dong Ye
:
The Number of Cliques in Graphs Covered by Long Cycles. SIAM J. Discret. Math. 37(2): 917-924 (2023) - 2022
- [j33]Wenzhong Liu, Mark N. Ellingham
, Dong Ye
:
Minimal quadrangulations of surfaces. J. Comb. Theory B 157: 235-262 (2022) - 2021
- [j32]Mark N. Ellingham
, Songling Shan
, Dong Ye
, Xiaoya Zha:
Toughness and spanning trees in K4-minor-free graphs. J. Graph Theory 96(3): 379-402 (2021) - [j31]Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye
, Gexin Yu
:
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35(1): 431-446 (2021) - 2020
- [j30]Ervin Györi, Michael D. Plummer, Dong Ye
, Xiaoya Zha:
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. Comb. 40(3): 405-433 (2020) - [j29]Michael D. Plummer, Dong Ye
, Xiaoya Zha:
Dominating maximal outerplane graphs and Hamiltonian plane triangulations. Discret. Appl. Math. 282: 162-167 (2020) - [j28]Li Zhang, You Lu, Rong Luo, Dong Ye
, Shenggui Zhang:
Edge coloring of signed graphs. Discret. Appl. Math. 282: 234-242 (2020) - [j27]Yezhou Wu, Dong Ye
:
Minimum T-Joins and Signed-Circuit Covering. SIAM J. Discret. Math. 34(2): 1192-1204 (2020)
2010 – 2019
- 2019
- [j26]Qiuli Li, Wai Chee Shiu, Pak Kiu Sun, Dong Ye
:
On the anti-Kekulé problem of cubic graphs. Art Discret. Appl. Math. 2(1): #P1.05 (2019) - [j25]Shaohui Zhai, Erling Wei, Jinghua He, Dong Ye
:
Homeomorphically irreducible spanning trees in hexangulations of surfaces. Discret. Math. 342(10): 2893-2899 (2019) - [j24]Wenzhong Liu, Serge Lawrencenko
, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye
, Xiaoya Zha:
Quadrangular embeddings of complete graphs and the Even Map Color Theorem. J. Comb. Theory B 139: 1-26 (2019) - [j23]Jinghua He, Erling Wei, Dong Ye
, Shaohui Zhai:
On perfect matchings in matching covered graphs. J. Graph Theory 90(4): 535-546 (2019) - 2018
- [j22]Shaohui Zhai, Dalal Awadh Alrowaili
, Dong Ye
:
Clar structures vs Fries structures in hexagonal systems. Appl. Math. Comput. 329: 384-394 (2018) - [j21]Yujun Yang, Dong Ye
:
Inverses of Bipartite Graphs. Comb. 38(5): 1251-1263 (2018) - [j20]Dong Ye
:
Maximum matchings in regular graphs. Discret. Math. 341(5): 1195-1198 (2018) - [j19]Liying Kang, Weihua Lu, Yezhou Wu, Dong Ye
, Cun-Quan Zhang:
Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs. Graphs Comb. 34(2): 365-372 (2018) - [j18]Yezhou Wu, Dong Ye
:
Circuit covers of cubic signed graphs. J. Graph Theory 89(1): 40-54 (2018) - [i2]Yezhou Wu, Dong Ye:
Minimum T-Joins and Signed-Circuit Covering. CoRR abs/1803.03696 (2018) - 2017
- [j17]Michael D. Plummer, Dong Ye
, Xiaoya Zha:
Connectivity and Wv -Paths in Polyhedral Maps on Surfaces. Discret. Comput. Geom. 58(1): 217-231 (2017) - [i1]Jinghua He, Erling Wei, Dong Ye, Shaohui Zhai:
On Perfect Matchings in Matching Covered Graphs. CoRR abs/1703.05412 (2017) - 2016
- [j16]Michael D. Plummer, Dong Ye
, Xiaoya Zha:
Dominating plane triangulations. Discret. Appl. Math. 211: 175-182 (2016) - [j15]Yezhou Wu, Dong Ye
, Cun-Quan Zhang
:
Uniquely forced perfect matching and unique 3-edge-coloring. Discret. Appl. Math. 215: 203-207 (2016) - [j14]Kenta Ozeki
, Dong Ye
:
Decomposing plane cubic graphs. Eur. J. Comb. 52: 40-46 (2016) - 2015
- [j13]Robert E. L. Aldred, Qiuli Li, Michael D. Plummer, Dong Ye, Heping Zhang:
Matching extension in toroidal quadrangulations II: the 3-extendable case. Australas. J Comb. 63: 268-296 (2015) - 2014
- [j12]Dong Ye, Heping Zhang:
Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces. Electron. J. Comb. 21(4): 4 (2014) - [j11]Jessica Ann Carr, Xiaofeng Wang, Dong Ye
:
Packing resonant hexagons in fullerenes. Discret. Optim. 13: 49-54 (2014) - [j10]Yezhou Wu
, Rong Luo, Dong Ye
, Cun-Quan Zhang:
A note on an extremal problem for group-connectivity. Eur. J. Comb. 40: 137-141 (2014) - [j9]Yezhou Wu, Dong Ye
, Wenan Zang, Cun-Quan Zhang:
Nowhere-Zero 3-Flows in Signed Graphs. SIAM J. Discret. Math. 28(3): 1628-1637 (2014) - 2013
- [j8]Dong Ye:
Hamilton Cycles in Cubic Polyhex Graphs on the Klein Bottle. Ars Comb. 112: 205-212 (2013) - [j7]Dong Ye
:
On the anti-Kekulé number and odd cycle transversal of regular graphs. Discret. Appl. Math. 161(13-14): 2196-2199 (2013) - [j6]Zhengke Miao, Dong Ye
, Cun-Quan Zhang:
Circuit extension and circuit double cover of graphs. Discret. Math. 313(20): 2055-2060 (2013) - 2012
- [j5]Dong Ye
, Cun-Quan Zhang:
Cycle double covers and the semi-Kotzig frame. Eur. J. Comb. 33(4): 624-631 (2012) - 2010
- [j4]Heping Zhang
, Dong Ye
, Wai Chee Shiu:
Forcing matching numbers of fullerene graphs. Discret. Appl. Math. 158(5): 573-582 (2010)
2000 – 2009
- 2009
- [j3]Dong Ye
, Heping Zhang
:
2-extendability of toroidal polyhexes and Klein-bottle polyhexes. Discret. Appl. Math. 157(2): 292-299 (2009) - [j2]Dong Ye
, Heping Zhang
:
Extremal fullerene graphs with the maximum Clar number. Discret. Appl. Math. 157(14): 3152-3173 (2009) - [j1]Dong Ye
, Zhongbin Qi, Heping Zhang
:
On k-Resonant Fullerene Graphs. SIAM J. Discret. Math. 23(2): 1023-1044 (2009) - 2007
- [c1]Jing Huang, Dong Ye
:
Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs. International Conference on Computational Science (3) 2007: 353-361
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-06 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint