Binlong Li

Orcid: 0000-0002-6971-8526

According to our database1, Binlong Li authored at least 62 papers between 2010 and 2024.

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



In proceedings 
PhD thesis 




Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs.
J. Graph Theory, January, 2024

Forbidden pairs of disconnected graphs for supereulerianity of connected graphs.
Discret. Math., January, 2024

Eigenvalues and cycles of consecutive lengths.
J. Graph Theory, July, 2023

The Turán number of directed paths and oriented cycles.
Graphs Comb., June, 2023

Anti-Ramsey numbers for vertex-disjoint triangles.
Discret. Math., 2023

Connected <i>k</i>-factors in bipartite graphs.
Discret. Math., 2023

Stability of Woodall's Theorem and Spectral Conditions for Large Cycles.
Electron. J. Comb., 2023

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles.
J. Comb. Theory B, 2022

More aspects of arbitrarily partitionable graphs.
Discuss. Math. Graph Theory, 2022

Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs.
Discret. Appl. Math., 2022

Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs.
Electron. J. Comb., 2022

Exact bipartite Turán numbers of large even cycles.
J. Graph Theory, 2021

A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture.
J. Comb. Theory B, 2021

An Injective Version of the 1-2-3 Conjecture.
Graphs Comb., 2021

Almost eulerian compatible spanning circuits in edge-colored graphs.
Discret. Math., 2021

The anti-Ramsey numbers of <i>C</i><sub>3</sub> and <i>C</i><sub>4</sub> in complete <i>r</i>-partite graphs.
Discret. Math., 2021

On minimizing the maximum color for the 1-2-3 Conjecture.
Discret. Appl. Math., 2021

Sub-Ramsey Numbers for Matchings.
Graphs Comb., 2020

Bipartite Independent Number and Hamilton-Biconnectedness of Bipartite Graphs.
Graphs Comb., 2020

Thomassen's conjecture for line graphs of 3-hypergraphs.
Discret. Math., 2020

Compatible spanning circuits in edge-colored graphs.
Discret. Math., 2020

A classification of edge-colored graphs based on properly colored walks.
Discret. Appl. Math., 2020

Kernels by rainbow paths in arc-colored tournaments.
Discret. Appl. Math., 2020

Lumos: A Library for Diagnosing Metric Regressions in Web-Scale Applications.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.
SIAM J. Discret. Math., 2019

Large degree vertices in longest cycles of graphs, II.
Electron. J. Graph Theory Appl., 2019

Extremal problems on the Hamiltonicity of claw-free graphs.
Discret. Math., 2018

Conditions for graphs to be path partition optimal.
Discret. Math., 2018

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.
Appl. Math. Comput., 2018

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

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

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

Heavy subgraphs, stability and Hamiltonicity.
Discuss. Math. Graph Theory, 2017

Forbidden pairs of disconnected graphs for traceability in connected graphs.
Discret. Math., 2017

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

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

On Star-Wheel Ramsey Numbers.
Graphs Comb., 2016

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

On the Ramsey-Goodness of Paths.
Graphs Comb., 2016

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

Large degree vertices in longest cycles of graphs, I.
Discuss. Math. Graph Theory, 2016

Forbidden subgraphs for hamiltonicity of 1-tough graphs.
Discuss. Math. Graph Theory, 2016

Universal arcs in tournaments.
Discret. Math., 2016

Distance powers of unitary Cayley graphs.
Appl. Math. Comput., 2016

Characterizing Heavy Subgraph Pairs for Pancyclicity.
Graphs Comb., 2015

A note on the number of spanning trees of line digraphs.
Discret. Math., 2015

Forbidden subgraphs for longest cycles to contain vertices with large degrees.
Discret. Math., 2015

Vertex-disjoint cycles in bipartite tournaments.
Discret. Math., 2015

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

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

Heavy subgraph pairs for traceability of block-chains.
Discuss. Math. Graph Theory, 2014

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

Forbidden subgraph pairs for traceability of block-chains.
Electron. J. Graph Theory Appl., 2013

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

Pairs of forbidden induced subgraphs for homogeneously traceable graphs.
Discret. Math., 2012

Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts.
Discret. Math., 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.
Discret. Math., 2010