default search action
Mingquan Zhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Xiaoling Ma, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
On s-hamiltonian-connected line graphs. Discuss. Math. Graph Theory 44(1): 297 (2024) - 2023
- [j32]Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai
:
Complete family reduction and spanning connectivity in line graphs. Discret. Math. 346(1): 113210 (2023) - [j31]Xia Liu, Sulin Song
On hamiltonian properties of K1,r-free split graphs. Discret. Math. 346(7): 113402 (2023) - 2022
- [j30]Lan Lei
On the extended Clark-Wormold Hamiltonian-like index problem. Discret. Math. 345(4): 112745 (2022) - 2021
- [j29]Wei Xiong, Sulin Song
Polynomially determining spanning connectivity of locally connected line graphs. Discret. Appl. Math. 295: 102-111 (2021) - [j28]Xiaoling Ma, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
On s-hamiltonicity of net-free line graphs. Discret. Math. 344(1): 112173 (2021) - [j27]Xiaoling Ma, Lan Lei, Hong-Jian Lai, Mingquan Zhan:
On the line graph of a graph with diameter 2. Discret. Math. 344(1): 112177 (2021) - [j26]Lan Lei
On (s, t)-supereulerian graphs with linear degree bounds. Discret. Math. 344(3): 112239 (2021) - 2020
- [j25]Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Pancyclicity of 4-connected claw-free net-free graphs. Australas. J Comb. 76: 366-386 (2020) - [j24]Hong-Jian Lai
Catlin's reduced graphs with small orders. AKCE Int. J. Graphs Comb. 17(2): 679-690 (2020)
2010 – 2019
- 2019
- [j23]Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
On s-hamiltonian line graphs of claw-free graphs. Discret. Math. 342(11): 3006-3016 (2019) - [j22]Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Pancyclicity of 4-Connected { K1, 3, Z8} -Free Graphs. Graphs Comb. 35(1): 67-89 (2019) - 2018
- [j21]Ping Li, Keke Wang, Mingquan Zhan, Hong-Jian Lai:
Strongly Spanning Trailable Graphs with Short Longest Paths. Ars Comb. 137: 3-39 (2018) - 2016
- [j20]Mingquan Zhan, Shuxin Zhan:
Full Cycle Extendability of Nearly Claw-Free Graphs. Ars Comb. 127: 339-356 (2016) - 2015
- [j19]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
K-5-factor in a Graph. Ars Comb. 122: 97-124 (2015) - [j18]Zhi-Hong Chen, Miaomiao Han
Graphs with a 3-Cycle-2-Cover. Graphs Comb. 31(6): 2103-2111 (2015) - 2013
- [j17]Hao Li, Ping Li, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Z3Z3-connectivity in Abelian Cayley graphs. Discret. Math. 313(16): 1666-1676 (2013) - 2012
- [j16]Xinmin Hou
Z3-connectivity of 4-edge-connected 2-triangular graphs. Eur. J. Comb. 33(2): 182-188 (2012) - [j15]Ping Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Spanning cycles in regular matroids without small cocircuits. Eur. J. Comb. 33(8): 1765-1776 (2012) - 2011
- [j14]Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan:
On 3-Edge-Connected Supereulerian Graphs. Graphs Comb. 27(2): 207-214 (2011) - 2010
- [j13]Mingquan Zhan:
Full cycle extendability of triangularly connected almost claw-free graphs. Ars Comb. 96 (2010) - [j12]Mingquan Zhan:
Hamiltonicity of 6-connected line graphs. Discret. Appl. Math. 158(17): 1971-1975 (2010) - [j11]Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai:
Degree sum condition for Z3-connectivity in graphs. Discret. Math. 310(23): 3390-3397 (2010)
2000 – 2009
- 2009
- [j10]Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan:
Hamiltonian connectedness in 3-connected line graphs. Discret. Appl. Math. 157(5): 982-990 (2009) - [j9]Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan:
Hamilton-connected indices of graphs. Discret. Math. 309(14): 4819-4827 (2009) - 2008
- [j8]Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian connected hourglass free line graphs. Discret. Math. 308(12): 2634-2636 (2008) - [j7]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected. Discret. Math. 308(22): 5312-5316 (2008) - 2007
- [j6]Mingquan Zhan:
Vertex pancyclicity in quasi claw-free graphs. Discret. Math. 307(13): 1679-1683 (2007) - [c1]Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian Connected Line Graphs. International Conference on Computational Science (3) 2007: 377-380 - 2006
- [j5]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonicity in 3-connected claw-free graphs. J. Comb. Theory B 96(4): 493-504 (2006) - 2005
- [j4]Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan Zhan:
Supereulerian planar graphs. Ars Comb. 75 (2005) - [j3]Dengxin Li, Hong-Jian Lai, Mingquan Zhan:
Eulerian subgraphs and Hamilton-connected line graphs. Discret. Appl. Math. 145(3): 422-428 (2005) - [j2]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian N2-locally connected claw-free graphs. J. Graph Theory 48(2): 142-146 (2005) - 2002
- [j1]Mingquan Zhan:
Neighborhood intersections and Hamiltonicity in almost claw-free graphs. Discret. Math. 243(1-3): 171-185 (2002)
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-07-09 21:11 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: