Ping Li - Citegraph

Author Info

Name	Affiliation	Papers
PING LI	Department of Mathematics, Beijing Jiaotong University, Beijing 100044, PR China	18
Collaborators	Citations	PageRank
28	21	7.14
Referers	Referees	References
46	90	112

Publications (18 rows)

Collaborators (28 rows)

Referers (46 rows)

Referees (90 rows)

Title	Citations	PageRank	Year
On the s-hamiltonianicity of an hourglass-free line graph	0	0.34	2022
On weighted modulo orientation of graphs	0	0.34	2020
Characterizations of matroids with an element lying in a restricted number of circuits.	0	0.34	2019
Strongly Spanning Trailable Graphs with Short Longest Paths.	1	0.37	2018
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.	4	0.60	2016
Supereulerian graphs with width s and s-collapsible graphs.	2	0.40	2016
Characterizations of Strength Extremal Graphs	1	0.37	2014
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs	1	0.38	2014
On Spanning Disjoint Paths in Line Graphs	4	0.44	2013
Z3Z3-connectivity in Abelian Cayley graphs.	0	0.34	2013
Characterization of removable elements with respect to having k disjoint bases in a matroid	2	0.45	2012
Group Connectivity of Complementary Graphs	2	0.41	2012
The Connectivity and Diameter of Second Order Circuit Graphs of Matroids.	0	0.34	2012
Spanning cycles in regular matroids without small cocircuits	1	0.35	2012
Mod (2p + 1) -orientations in line graphs	0	0.34	2011
Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected.	0	0.34	2011
Degree sequences and graphs with disjoint spanning trees	3	0.65	2011
Group connectivity in line graphs	0	0.34	2011

1