default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSongling Shan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Masahiro Sanka
, Songling Shan:
An Ore-Type Condition for Hamiltonicity in Tough Graphs and the Extremal Examples. Electron. J. Comb. 31(1) (2024)- [j42]Songling Shan, Xiaowei Yu:
Antimagic orientation of forests. Discret. Math. 347(1): 113666 (2024) - [j41]Zhanar Berikkyzy, Beth Bjorkman, Heather C. Smith Blake, Sogol Jahanbekam, Lauren Keough, Kevin Moss, Danny Rorabaugh, Songling Shan:
Triangle-degree and triangle-distinct graphs. Discret. Math. 347(1): 113695 (2024) - [j40]Yan Cao, Guantao Chen, Guangming Jing, Xuli Qi, Songling Shan:
Precoloring extension of Vizing's Theorem for multigraphs. Eur. J. Comb. 122: 104037 (2024) - [j39]Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
The core conjecture of Hilton and Zhao. J. Comb. Theory B 166: 154-182 (2024) - 2023
- [j38]Elizabeth Grimm, Anna Johnsen, Songling Shan:
Existence of 2-factors in tough graphs without forbidden subgraphs. Discret. Math. 346(10): 113578 (2023) - [j37]Michael J. Plantholt, Songling Shan:
Edge coloring graphs with large minimum degree. J. Graph Theory 102(4): 611-632 (2023) - [j36]Songling Shan, Shoichi Tsuchiya:
Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree. J. Graph Theory 104(4): 886-903 (2023) - 2022
- [j35]Songling Shan:
An Ore-Type Condition for Hamiltonicity in Tough Graphs. Electron. J. Comb. 29(1) (2022) - [j34]Alexandr V. Kostochka, Ruth Luo, Songling Shan:
Towards the Small Quasi-Kernel Conjecture. Electron. J. Comb. 29(3) (2022) - [j33]Jessica Ferraro, Genevieve A. Newkirk, Songling Shan:
Antimagic orientation of subdivided caterpillars. Discret. Appl. Math. 313: 45-52 (2022) - [j32]Yan Cao, Guantao Chen, Songling Shan:
An improvement to the Hilton-Zhao vertex-splitting conjecture. Discret. Math. 345(8): 112902 (2022) - [j31]Yuping Gao, Songling Shan:
Hamiltonian cycles in 7-tough (P3 ∪ 2P1)-free graphs. Discret. Math. 345(12): 113069 (2022) - [j30]Lingjuan Shi, Songling Shan:
A note on hamiltonian cycles in 4-tough (P2 ∪ kP1)-free graphs. Discret. Math. 345(12): 113081 (2022) - [j29]Yuping Gao, Songling Shan:
Erdős-Gyárfás conjecture for P8-free graphs. Graphs Comb. 38(6): 168 (2022) - [j28]Yan Cao, Guantao Chen, Songling Shan:
Overfullness of critical class 2 graphs with a small core degree. J. Comb. Theory B 156: 145-173 (2022) - [j27]Songling Shan:
Chromatic index of dense quasirandom graphs. J. Comb. Theory B 157: 429-450 (2022) - [j26]Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
Independence number of edge-chromatic critical graphs. J. Graph Theory 101(2): 288-310 (2022) - [j25]Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree. SIAM J. Discret. Math. 36(3): 2258-2270 (2022) - 2021
- [j24]Songling Shan:
Hamiltonian Cycles in Tough $(P_2\cup P_3)$-Free Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j23]Yuping Gao, Songling Shan:
Nonempty intersection of longest paths in graphs without forbidden pairs. Discret. Appl. Math. 304: 76-83 (2021) - [j22]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) - [j21]Songling Shan:
Antimagic orientation of graphs with minimum degree at least 33. J. Graph Theory 98(4): 676-690 (2021) - 2020
- [j20]Mark N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan:
Toughness and prism-hamiltonicity of P4-free graphs. Discret. Appl. Math. 284: 201-206 (2020) - [j19]Yuping Gao, Songling Shan:
Antimagic orientation of lobsters. Discret. Appl. Math. 287: 21-26 (2020) - [j18]Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell:
Regular colorings in regular graphs. Discuss. Math. Graph Theory 40(3): 795-806 (2020) - [j17]Songling Shan:
Hamiltonian cycles in 3-tough 2K 2-free graphs. J. Graph Theory 94(3): 349-363 (2020)
2010 – 2019
- 2019
- [j16]Jinko Kanno, Songling Shan:
Vizing's 2-Factor Conjecture Involving Toughness and Maximum Degree Conditions. Electron. J. Comb. 26(2): 2 (2019) - [j15]Guantao Chen, Michitaka Furuya, Songling Shan, Shoichi Tsuchiya, Ping Yang:
Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw. Graphs Comb. 35(6): 1459-1474 (2019) - [j14]Guantao Chen, Songling Shan:
Dirac's Condition for Spanning Halin Subgraphs. SIAM J. Discret. Math. 33(4): 1997-2022 (2019) - 2018
- [j13]Gili Golan, Songling Shan:
Nonempty Intersection of Longest Paths in 2K2-Free Graphs. Electron. J. Comb. 25(2): 2 (2018) - [j12]Guantao Chen, Yuping Gao, Ringi Kim, Luke Postle, Songling Shan:
Chromatic index determined by fractional chromatic index. J. Comb. Theory B 131: 85-108 (2018) - 2017
- [j11]Songling Shan, Xiaowei Yu:
Antimagic Orientation of Biregular Bipartite Graphs. Electron. J. Comb. 24(4): 4 (2017) - [j10]Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise, Songling Shan, Ping Yang, Amy N. Yates:
Nonempty intersection of longest paths in series-parallel graphs. Discret. Math. 340(3): 287-304 (2017) - [j9]Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan:
Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs. Graphs Comb. 33(5): 1095-1101 (2017) - [j8]Guantao Chen, Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya:
Forbidden Pairs and the Existence of a Spanning Halin Subgraph. Graphs Comb. 33(5): 1321-1345 (2017) - [j7]Guantao Chen, Yuping Gao, Songling Shan, Guanghui Wang, Jianliang Wu:
Equitable vertex arboricity of 5-degenerate graphs. J. Comb. Optim. 34(2): 426-432 (2017) - [j6]Guantao Chen, Songling Shan:
Vizing's 2-Factor Conjecture Involving Large Maximum Degree. J. Graph Theory 86(4): 422-438 (2017) - 2016
- [c4]Baojiang Cui, Yang Wei, Songling Shan, Jinxin Ma:
The generation of XSS attacks developing in the detect detection. BWCCA 2016: 353-361 - [c3]Pengfei Li, Songling Shan:
An Improved Algorithm of Prefixspan. IMIS 2016: 291-294 - [c2]Jun Yang, Xiangping Du, Liang Zhou, Songling Shan, Baojiang Cui:
Research on the Identification of Software Behavior in Anomaly Detection. IMIS 2016: 295-298 - [i1]Songling Shan, Bing Yao:
A Note On Vertex Distinguishing Edge colorings of Trees. CoRR abs/1601.02601 (2016) - 2015
- [j5]Guantao Chen, Songling Shan:
Characterizing Forbidden Pairs for Hamiltonian Squares. Graphs Comb. 31(6): 2113-2124 (2015) - [j4]Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan:
Disjoint Chorded Cycles of the Same Length. SIAM J. Discret. Math. 29(2): 1030-1041 (2015) - [c1]Lifang Han, Tingting Hou, Songling Shan, Yikang Li, Baojiang Cui:
The Research of Aspect-Oriented Dynamic Analysis Based on Static Analysis. BWCCA 2015: 114-119 - 2013
- [j3]Guantao Chen, Songling Shan:
Homeomorphically irreducible spanning trees. J. Comb. Theory B 103(4): 409-414 (2013) - [j2]Guantao Chen, Akira Saito, Songling Shan:
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition. SIAM J. Discret. Math. 27(4): 1788-1799 (2013) - 2012
- [j1]Guantao Chen, Han Ren, Songling Shan:
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs. Comb. Probab. Comput. 21(1-2): 107-111 (2012)
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 2025-01-21 00:06 CET 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:
