Binlong Li

According to our database1, Binlong Li authored at least 36 papers between 2010 and 2018.

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



In proceedings 
PhD thesis 




Extremal problems on the Hamiltonicity of claw-free graphs.
Discrete Mathematics, 2018

Conditions for graphs to be path partition optimal.
Discrete Mathematics, 2018

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.
Applied Mathematics and Computation, 2018

Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity.
Journal of Graph Theory, 2017

An Exact Formula for all Star-Kipas Ramsey Numbers.
Graphs and Combinatorics, 2017

Cycles through all finite vertex sets in infinite graphs.
Eur. J. Comb., 2017

Heavy subgraphs, stability and Hamiltonicity.
Discussiones Mathematicae Graph Theory, 2017

Forbidden pairs of disconnected graphs for traceability in connected graphs.
Discrete Mathematics, 2017

Disjoint Cycles of Different Lengths in Graphs and Digraphs.
Electr. J. Comb., 2017

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions.
Graphs and Combinatorics, 2016

On Star-Wheel Ramsey Numbers.
Graphs and Combinatorics, 2016

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition.
Graphs and Combinatorics, 2016

On the Ramsey-Goodness of Paths.
Graphs and Combinatorics, 2016

Heavy subgraph conditions for longest cycles to be heavy in graphs.
Discussiones Mathematicae Graph Theory, 2016

Large degree vertices in longest cycles of graphs, I.
Discussiones Mathematicae Graph Theory, 2016

Forbidden subgraphs for hamiltonicity of 1-tough graphs.
Discussiones Mathematicae Graph Theory, 2016

Universal arcs in tournaments.
Discrete Mathematics, 2016

Distance powers of unitary Cayley graphs.
Applied Mathematics and Computation, 2016

Characterizing Heavy Subgraph Pairs for Pancyclicity.
Graphs and Combinatorics, 2015

A note on the number of spanning trees of line digraphs.
Discrete Mathematics, 2015

Forbidden subgraphs for longest cycles to contain vertices with large degrees.
Discrete Mathematics, 2015

Vertex-disjoint cycles in bipartite tournaments.
Discrete Mathematics, 2015

Closing the Gap on Path-Kipas Ramsey Numbers.
Electr. J. Comb., 2015

Rainbow triangles in edge-colored graphs.
Eur. J. Comb., 2014

Heavy subgraph pairs for traceability of block-chains.
Discussiones Mathematicae Graph Theory, 2014

The Ramsey Numbers of Paths Versus Wheels: a Complete Solution.
Electr. J. Comb., 2014

Forbidden subgraph pairs for traceability of block-chains.
EJGTA, 2013

Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs.
SIAM J. Discrete Math., 2012

Pairs of forbidden induced subgraphs for homogeneously traceable graphs.
Discrete Mathematics, 2012

Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts.
Discrete Mathematics, 2012

Notes on heavy cycles in weighted digraphs.
Appl. Math. Lett., 2012

Cross-view activity recognition using Hankelets.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

Heavy cycles and spanning trees with few leaves in weighted graphs.
Appl. Math. Lett., 2011

Dynamic subspace-based coordinated multicamera tracking.
Proceedings of the IEEE International Conference on Computer Vision, 2011

Activity recognition using dynamic subspace angles.
Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011

On extremal weighted digraphs with no heavy paths.
Discrete Mathematics, 2010