Остановите войну!
for scientists:
default search action
Zhi-Hong Chen
- > Home > Persons > Zhi-Hong Chen
Publications
- 2017
- [j45]Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang:
Spanning trails with variations of Chvátal-Erdős conditions. Discret. Math. 340(2): 243-251 (2017) - [j40]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong:
Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. J. Comb. Theory, Ser. B 122: 167-186 (2017) - 2015
- [j33]Wei-Guo Chen, Zhi-Hong Chen, Mei Lu:
Lai's Conditions for Spanning and Dominating Closed Trails. Electron. J. Comb. 22(1): 1 (2015) - [j32]Wei-Guo Chen, Zhi-Hong Chen:
Fan-Type Conditions for Spanning Eulerian Subgraphs. Graphs Comb. 31(6): 2087-2102 (2015) - [j31]Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai, Mingquan Zhan:
Graphs with a 3-Cycle-2-Cover. Graphs Comb. 31(6): 2103-2111 (2015) - 2014
- [j30]Wei-Guo Chen, Zhi-Hong Chen, Weiqi Luo:
Edge-connectivities for spanning trails with prescribed edges. Ars Comb. 115: 175-186 (2014) - [j27]Jinquan Xu, Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang:
Spanning trails in essentially 4-edge-connected graphs. Discret. Appl. Math. 162: 306-313 (2014) - 2013
- [j24]Ye Chen, Zhi-Hong Chen, Hong-Jian Lai, Ping Li, Erling Wei:
On Spanning Disjoint Paths in Line Graphs. Graphs Comb. 29(6): 1721-1731 (2013) - 2009
- [j17]Damin Liu, Hong-Jian Lai, Zhi-Hong Chen:
Reinforcing the number of disjoint spanning trees. Ars Comb. 93 (2009) - [j15]Zhi-Hong Chen, Peter C. B. Lam, Wai-Chee Shiu:
Collapsible graphs and reductions of line graphs. Discret. Math. 309(10): 3173-3184 (2009) - [j14]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan:
Hamilton-connected indices of graphs. Discret. Math. 309(14): 4819-4827 (2009) - 2007
- [j12]Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li:
An s -Hamiltonian Line Graph Problem. Graphs Comb. 23(3): 241-248 (2007) - 2006
- [j11]Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen:
Spanning trails containing given edges. Discret. Math. 306(1): 87-98 (2006) - 2003
- [j10]Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao:
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. J. Graph Theory 42(4): 308-319 (2003) - 2001
- [j9]Zhi-Hong Chen, Hong-Jian Lai, Hongyuan Lai:
Nowhere zero flows in line graphs. Discret. Math. 230(1-3): 133-141 (2001) - 1999
- [j8]Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai:
Connectivity of cycle matroids and bicircular matroids. Ars Comb. 52 (1999) - 1998
- [j7]Zhi-Hong Chen, Hong-Jian Lai:
Supereulerian graphs and the Petersen Graph, II. Ars Comb. 48 (1998) - 1993
- [j1]Zhi-Hong Chen, Hong-Jian Lai:
Collapsible graphs and matchings. J. Graph Theory 17(5): 597-605 (1993)
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-02-07 03:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint