Ping Li

Affiliations:
  • Beijing Jiaotong University, Department of Mathematics, China
  • West Virginia University, Department of Mathematics, Morgantown, USA (PhD 2012)


According to our database1, Ping Li authored at least 19 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Supereulerian regular matroids without small cocircuits.
J. Graph Theory, 2023

2022
On the <i>s</i>-hamiltonianicity of an hourglass-free line graph.
Discret. Math., 2022

2020
On weighted modulo orientation of graphs.
Eur. J. Comb., 2020

2019
Characterizations of matroids with an element lying in a restricted number of circuits.
J. Comb. Optim., 2019

2018
Strongly Spanning Trailable Graphs with Short Longest Paths.
Ars Comb., 2018

2016
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.
J. Graph Theory, 2016

Supereulerian graphs with width s and s-collapsible graphs.
Discret. Appl. Math., 2016

2014
On Mod (2s+1)-Orientations of Graphs.
SIAM J. Discret. Math., 2014

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.
Int. J. Comput. Math., 2014

Characterizations of Strength Extremal Graphs.
Graphs Comb., 2014

2013
On Spanning Disjoint Paths in Line Graphs.
Graphs Comb., 2013

2012
Group connectivity of complementary graphs.
J. Graph Theory, 2012

The Connectivity and Diameter of Second Order Circuit Graphs of Matroids.
Graphs Comb., 2012

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

Characterization of removable elements with respect to having k disjoint bases in a matroid.
Discret. Appl. Math., 2012

2011
Mod (2p+1)-orientations in line graphs.
Inf. Process. Lett., 2011

Every N<sub>2</sub>-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z<sub>3</sub>-Connected.
Discret. Math. Algorithms Appl., 2011

Group connectivity in line graphs.
Discret. Math., 2011

Degree sequences and graphs with disjoint spanning trees.
Discret. Appl. Math., 2011


  Loading...