default search action
Yehong Shao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j32]Sulin Song, Lan Lei, Yehong Shao, Hong-Jian Lai:
Asymptotically sharpening the $s$-Hamiltonian index bound. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j31]Yehong Shao:
Bounds on the connectivity of iterated line graphs. Electron. J. Graph Theory Appl. 10(2): 565-573 (2022) - 2021
- [j30]Lili Zhang
, Yaxue Wei
Real-Time Detection of River Surface Floating Object Based on Improved RefineDet. IEEE Access 9: 81147-81160 (2021) - [j29]Lili Zhang, Yu Fan, Ruijie Yan, Yehong Shao, Gaoxu Wang, Jisen Wu:
Fine-Grained Tidal Flat Waterbody Extraction Method (FYOLOv3) for High-Resolution Remote Sensing Images. Remote. Sens. 13(13): 2594 (2021) - 2020
- [j28]Lili Zhang, Jisen Wu, Yu Fan, Hongmin Gao
An Efficient Building Extraction Method from High Spatial Resolution Remote Sensing Images Based on Improved Mask R-CNN. Sensors 20(5): 1465 (2020)
2010 – 2019
- 2018
- [j27]Yehong Shao:
Essential edge connectivity of line graphs. Discret. Math. 341(12): 3441-3446 (2018) - 2017
- [c2]Lili Zhang, Huibin Wang, Chenming Li, Yehong Shao, Qing Ye:
Unsupervised Anomaly Detection Algorithm of Graph Data Based on Graph Kernel. CSCloud 2017: 58-63 - 2015
- [j26]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
K-5-factor in a Graph. Ars Comb. 122: 97-124 (2015) - 2014
- [j25]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - 2013
- [j24]Hong-Jian Lai, Yehong Shao:
On s-Hamiltonian Line Graphs. J. Graph Theory 74(3): 344-358 (2013) - 2012
- [j23]Kewen Zhao, Lili Zhang, Hong-Jian Lai, Yehong Shao:
Hamiltonian graphs involving neighborhood conditions. Ars Comb. 105: 161-170 (2012) - [j22]Xiangwen Li, Hong-Jian Lai, Yehong Shao:
Degree condition and Z3-connectivity. Discret. Math. 312(10): 1658-1669 (2012) - [j21]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) - [j20]Zhang Lili, Yehong Shao, Guihai Chen
s-Vertex Pancyclic Index. Graphs Comb. 28(3): 393-406 (2012) - 2011
- [j19]Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu:
Obstructions to a binary matroid being graphic. Eur. J. Comb. 32(6): 853-860 (2011) - [j18]Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan:
On 3-Edge-Connected Supereulerian Graphs. Graphs Comb. 27(2): 207-214 (2011) - 2010
- [j17]Hong-Jian Lai, Mingchu Li, Yehong Shao, Liming Xiong:
Spanning eulerian subgraphs in N2-locally connected claw-free graphs. Ars Comb. 94 (2010) - [j16]Yehong Shao:
Connectivity of iterated line graphs. Discret. Appl. Math. 158(18): 2081-2087 (2010) - [j15]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
- [j14]Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan:
Hamiltonian connectedness in 3-connected line graphs. Discret. Appl. Math. 157(5): 982-990 (2009) - [j13]Paul A. Catlin, Hong-Jian Lai, Yehong Shao:
Edge-connectivity and edge-disjoint spanning trees. Discret. Math. 309(5): 1033-1040 (2009) - [j12]Hong-Jian Lai, Lianying Miao, Yehong Shao:
Every line graph of a 4-edge-connected graph is I-connected. Eur. J. Comb. 30(2): 595-601 (2009) - [j11]Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
On mod (2p+1)-orientations of graphs. J. Comb. Theory B 99(2): 399-406 (2009) - 2008
- [j10]Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian connected hourglass free line graphs. Discret. Math. 308(12): 2634-2636 (2008) - [j9]Hong-Jian Lai, Yanting Liang, Yehong Shao:
On s-hamiltonian-connected line graphs. Discret. Math. 308(18): 4293-4297 (2008) - [j8]Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao:
The s-Hamiltonian index. Discret. Math. 308(20): 4779-4785 (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) - [j6]Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang, Ju Zhou:
Degree sequence and supereulerian graphs. Discret. Math. 308(24): 6626-6631 (2008) - [j5]Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao:
Spanning cycles in regular matroids without M*(K5) minors. Eur. J. Comb. 29(1): 298-310 (2008) - 2007
- [j4]Kewen Zhao, Hong-Jian Lai, Yehong Shao:
New sufficient condition for Hamiltonian graphs. Appl. Math. Lett. 20(1): 116-122 (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
- [j3]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonicity in 3-connected claw-free graphs. J. Comb. Theory B 96(4): 493-504 (2006) - [j2]Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
Every 3-connected, essentially 11-connected line graph is Hamiltonian. J. Comb. Theory B 96(4): 571-576 (2006) - 2005
- [j1]Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonian N2-locally connected claw-free graphs. J. Graph Theory 48(2): 142-146 (2005)
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-06-10 20:24 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: