Songling Shan

Orcid: 0000-0002-6384-2876

According to our database1, Songling Shan authored at least 46 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Antimagic orientation of forests.
Discret. Math., January, 2024

Triangle-degree and triangle-distinct graphs.
Discret. Math., January, 2024

An Ore-Type Condition for Hamiltonicity in Tough Graphs and the Extremal Examples.
Electron. J. Comb., 2024

2023
Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree.
J. Graph Theory, December, 2023

Edge coloring graphs with large minimum degree.
J. Graph Theory, April, 2023

Existence of 2-factors in tough graphs without forbidden subgraphs.
Discret. Math., 2023

2022
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree.
SIAM J. Discret. Math., September, 2022

Independence number of edge-chromatic critical graphs.
J. Graph Theory, 2022

Chromatic index of dense quasirandom graphs.
J. Comb. Theory, Ser. B, 2022

Overfullness of critical class 2 graphs with a small core degree.
J. Comb. Theory, Ser. B, 2022

Erdős-Gyárfás conjecture for P<sub>8</sub>-free graphs.
Graphs Comb., 2022

A note on hamiltonian cycles in 4-tough (<i>P</i><sub>2</sub> ∪ <i>kP</i><sub>1</sub>)-free graphs.
Discret. Math., 2022

Hamiltonian cycles in 7-tough (<i>P</i><sub>3</sub> ∪ 2<i>P</i><sub>1</sub>)-free graphs.
Discret. Math., 2022

An improvement to the Hilton-Zhao vertex-splitting conjecture.
Discret. Math., 2022

Antimagic orientation of subdivided caterpillars.
Discret. Appl. Math., 2022

An Ore-Type Condition for Hamiltonicity in Tough Graphs.
Electron. J. Comb., 2022

Towards the Small Quasi-Kernel Conjecture.
Electron. J. Comb., 2022

2021
Antimagic orientation of graphs with minimum degree at least 33.
J. Graph Theory, 2021

Toughness and spanning trees in K<sub>4</sub>-minor-free graphs.
J. Graph Theory, 2021

Nonempty intersection of longest paths in graphs without forbidden pairs.
Discret. Appl. Math., 2021

Hamiltonian Cycles in Tough $(P_2\cup P_3)$-Free Graphs.
Electron. J. Comb., 2021

2020
Hamiltonian cycles in 3-tough 2K 2-free graphs.
J. Graph Theory, 2020

Regular colorings in regular graphs.
Discuss. Math. Graph Theory, 2020

Antimagic orientation of lobsters.
Discret. Appl. Math., 2020

Toughness and prism-hamiltonicity of P4-free graphs.
Discret. Appl. Math., 2020

2019
Dirac's Condition for Spanning Halin Subgraphs.
SIAM J. Discret. Math., 2019

Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw.
Graphs Comb., 2019

Vizing's 2-Factor Conjecture Involving Toughness and Maximum Degree Conditions.
Electron. J. Comb., 2019

2018
Chromatic index determined by fractional chromatic index.
J. Comb. Theory, Ser. B, 2018

Nonempty Intersection of Longest Paths in 2K<sub>2</sub>-Free Graphs.
Electron. J. Comb., 2018

2017
Vizing's 2-Factor Conjecture Involving Large Maximum Degree.
J. Graph Theory, 2017

Equitable vertex arboricity of 5-degenerate graphs.
J. Comb. Optim., 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.
Graphs Comb., 2017

Spanning Trails with Maximum Degree at Most 4 in 2K<sub>2</sub> -Free Graphs.
Graphs Comb., 2017

Nonempty intersection of longest paths in series-parallel graphs.
Discret. Math., 2017

Antimagic Orientation of Biregular Bipartite Graphs.
Electron. J. Comb., 2017

2016
A Note On Vertex Distinguishing Edge colorings of Trees.
CoRR, 2016

Research on the Identification of Software Behavior in Anomaly Detection.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

An Improved Algorithm of Prefixspan.
Proceedings of the 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2016

The generation of XSS attacks developing in the detect detection.
Proceedings of the Advances on Broad-Band Wireless Computing, 2016

2015
Disjoint Chorded Cycles of the Same Length.
SIAM J. Discret. Math., 2015

Characterizing Forbidden Pairs for Hamiltonian Squares.
Graphs Comb., 2015

The Research of Aspect-Oriented Dynamic Analysis Based on Static Analysis.
Proceedings of the 10th International Conference on Broadband and Wireless Computing, 2015

2013
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition.
SIAM J. Discret. Math., 2013

Homeomorphically irreducible spanning trees.
J. Comb. Theory, Ser. B, 2013

2012
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs.
Comb. Probab. Comput., 2012


  Loading...