Yehong Shao

According to our database1, Yehong Shao authored at least 29 papers between 2005 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Essential edge connectivity of line graphs.
Discrete Mathematics, 2018

2017
Unsupervised Anomaly Detection Algorithm of Graph Data Based on Graph Kernel.
Proceedings of the 4th IEEE International Conference on Cyber Security and Cloud Computing, 2017

2015
K-5-factor in a Graph.
Ars Comb., 2015

2014
On strongly Z2s-1-connected graphs.
Discrete Applied Mathematics, 2014

2013
On s-Hamiltonian Line Graphs.
Journal of Graph Theory, 2013

2012
s-Vertex Pancyclic Index.
Graphs and Combinatorics, 2012

Spanning cycles in regular matroids without small cocircuits.
Eur. J. Comb., 2012

Degree condition and Z3-connectivity.
Discrete Mathematics, 2012

Hamiltonian graphs involving neighborhood conditions.
Ars Comb., 2012

2011
On 3-Edge-Connected Supereulerian Graphs.
Graphs and Combinatorics, 2011

Obstructions to a binary matroid being graphic.
Eur. J. Comb., 2011

2010
Degree sum condition for Z3-connectivity in graphs.
Discrete Mathematics, 2010

Connectivity of iterated line graphs.
Discrete Applied Mathematics, 2010

Spanning eulerian subgraphs in N2-locally connected claw-free graphs.
Ars Comb., 2010

2009
On mod (2p+1)-orientations of graphs.
J. Comb. Theory, Ser. B, 2009

Every line graph of a 4-edge-connected graph is I-connected.
Eur. J. Comb., 2009

Edge-connectivity and edge-disjoint spanning trees.
Discrete Mathematics, 2009

Hamiltonian connectedness in 3-connected line graphs.
Discrete Applied Mathematics, 2009

2008
Spanning cycles in regular matroids without M*(K5) minors.
Eur. J. Comb., 2008

The s-Hamiltonian index.
Discrete Mathematics, 2008

Hamiltonian connected hourglass free line graphs.
Discrete Mathematics, 2008

Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.
Discrete Mathematics, 2008

On s-hamiltonian-connected line graphs.
Discrete Mathematics, 2008

Degree sequence and supereulerian graphs.
Discrete Mathematics, 2008

2007
New sufficient condition for Hamiltonian graphs.
Appl. Math. Lett., 2007

Hamiltonian Connected Line Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006
Hamiltonicity in 3-connected claw-free graphs.
J. Comb. Theory, Ser. B, 2006

Every 3-connected, essentially 11-connected line graph is Hamiltonian.
J. Comb. Theory, Ser. B, 2006

2005
Hamiltonian N2-locally connected claw-free graphs.
Journal of Graph Theory, 2005


  Loading...