Nonempty intersection of longest paths in series–parallel graphs G Chen, J Ehrenmüller, CG Fernandes, CG Heise, S Shan, P Yang, ...
Discrete mathematics 340 (3), 287-304, 2017
33 2017 Homeomorphically irreducible spanning trees in locally connected graphs G Chen, H Ren, S Shan
Combinatorics, Probability and Computing 21 (1-2), 107-111, 2012
23 2012 Antimagic orientation of biregular bipartite graphs S Shan, X Yu
arXiv preprint arXiv:1706.07336, 2017
20 2017 Homeomorphically irreducible spanning trees G Chen, S Shan
Journal of Combinatorial Theory, Series B 103 (4), 409-414, 2013
19 2013 Nonempty intersection of longest paths in G Golan, S Shan
arXiv preprint arXiv:1611.05967, 2016
16 2016 The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition G Chen, A Saito, S Shan
SIAM Journal on Discrete Mathematics 27 (4), 1788-1799, 2013
15 2013 Equitable vertex arboricity of 5-degenerate graphs G Chen, Y Gao, S Shan, G Wang, J Wu
Journal of Combinatorial Optimization 34, 426-432, 2017
13 2017 Hamiltonian cycles in 3‐tough 2K 2 ‐free graphs S Shan
Journal of Graph Theory 94 (3), 349-363, 2020
11 2020 Hamiltonian cycles in tough S Shan
arXiv preprint arXiv:1901.02475, 2019
11 2019 Antimagic orientation of lobsters Y Gao, S Shan
Discrete Applied Mathematics 287, 21-26, 2020
10 2020 Towards the small quasi-kernel conjecture A Kostochka, R Luo, S Shan
arXiv preprint arXiv:2001.04003, 2020
10 2020 Hamiltonian cycles in 7-tough (P3∪ 2P1)-free graphs Y Gao, S Shan
Discrete Mathematics 345 (12), 113069, 2022
7 2022 Proof of the core conjecture of Hilton and Zhao Y Cao, G Chen, G Jing, S Shan
arXiv preprint arXiv:2004.00734, 2020
7 2020 Antimagic orientation of graphs with minimum degree at least 33 S Shan
Journal of Graph theory 98 (4), 676-690, 2021
6 2021 Toughness and prism-hamiltonicity of P4-free graphs MN Ellingham, PS Nowbandegani, S Shan
Discrete Applied Mathematics 284, 201-206, 2020
6 2020 Chromatic index determined by fractional chromatic index G Chen, Y Gao, R Kim, L Postle, S Shan
Journal of Combinatorial Theory, Series B 131, 85-108, 2018
6 2018 Vizing's 2‐Factor Conjecture Involving Large Maximum Degree G Chen, S Shan
Journal of Graph Theory 86 (4), 422-438, 2017
6 2017 Vizing's 2-factor conjecture involving toughness and maximum degree conditions J Kanno, S Shan
arXiv preprint arXiv:1709.02241, 2017
6 2017 A note on hamiltonian cycles in 4-tough (P2∪ kP1)-free graphs L Shi, S Shan
Discrete Mathematics 345 (12), 113081, 2022
5 2022 Edge coloring graphs with large minimum degree MJ Plantholt, S Shan
Journal of Graph Theory 102 (4), 611-632, 2023
4 2023 