default search action
Binlong Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j58]Binlong Li, Xia Liu, Shipeng Wang:
Forbidden pairs of disconnected graphs for supereulerianity of connected graphs. Discret. Math. 347(1): 113663 (2024) - [j57]Fangfang Wu
, Hajo Broersma
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. J. Graph Theory 105(1): 110-135 (2024) - 2023
- [j56]Binlong Li, Bo Ning
Stability of Woodall's Theorem and Spectral Conditions for Large Cycles. Electron. J. Comb. 30(1) (2023) - [j55]Fangfang Wu
Anti-Ramsey numbers for vertex-disjoint triangles. Discret. Math. 346(1): 113123 (2023) - [j54]Yandong Bai
Connected k-factors in bipartite graphs. Discret. Math. 346(1): 113174 (2023) - [j53]Wenling Zhou, Binlong Li
The Turán number of directed paths and oriented cycles. Graphs Comb. 39(3): 47 (2023) - [j52]Binlong Li, Bo Ning
Eigenvalues and cycles of consecutive lengths. J. Graph Theory 103(3): 486-492 (2023) - 2022
- [j51]Maria Chudnovsky
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs. Electron. J. Comb. 29(2) (2022) - [j50]Fangfang Wu
Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs. Discret. Appl. Math. 307: 145-152 (2022) - [j49]Julien Bensmail
More aspects of arbitrarily partitionable graphs. Discuss. Math. Graph Theory 42(4): 1237-1261 (2022) - [j48]Binlong Li, Jie Ma
Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles. J. Comb. Theory B 152: 399-414 (2022) - 2021
- [j47]Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse:
On minimizing the maximum color for the 1-2-3 Conjecture. Discret. Appl. Math. 289: 32-51 (2021) - [j46]Zhiwei Guo, Hajo Broersma
Almost eulerian compatible spanning circuits in edge-colored graphs. Discret. Math. 344(1): 112174 (2021) - [j45]Chunqiu Fang
The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs. Discret. Math. 344(11): 112540 (2021) - [j44]Julien Bensmail, Bi Li, Binlong Li:
An Injective Version of the 1-2-3 Conjecture. Graphs Comb. 37(1): 281-311 (2021) - [j43]Binlong Li, Bo Ning
A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture. J. Comb. Theory B 146: 76-95 (2021) - [j42]Binlong Li, Bo Ning
Exact bipartite Turán numbers of large even cycles. J. Graph Theory 97(4): 642-656 (2021) - 2020
- [j41]Yandong Bai
Kernels by rainbow paths in arc-colored tournaments. Discret. Appl. Math. 282: 14-21 (2020) - [j40]Ruonan Li
A classification of edge-colored graphs based on properly colored walks. Discret. Appl. Math. 283: 590-595 (2020) - [j39]Binlong Li, Kenta Ozeki
Thomassen's conjecture for line graphs of 3-hypergraphs. Discret. Math. 343(6): 111838 (2020) - [j38]Zhiwei Guo, Binlong Li, Xueliang Li, Shenggui Zhang:
Compatible spanning circuits in edge-colored graphs. Discret. Math. 343(7): 111908 (2020) - [j37]Binlong Li:
Bipartite Independent Number and Hamilton-Biconnectedness of Bipartite Graphs. Graphs Comb. 36(6): 1639-1653 (2020) - [j36]Fangfang Wu
Sub-Ramsey Numbers for Matchings. Graphs Comb. 36(6): 1675-1685 (2020) - [c4]Jamie Pool, Ebrahim Beyrami, Vishak Gopal, Ashkan Aazami, Jayant Gupchup, Jeff Rowland, Binlong Li, Pritesh Kanani, Ross Cutler, Johannes Gehrke:
Lumos: A Library for Diagnosing Metric Regressions in Web-Scale Applications. KDD 2020: 2562-2570 - [i1]Jamie Pool, Ebrahim Beyrami, Vishak Gopal, Ashkan Aazami, Jayant Gupchup, Jeff Rowland, Binlong Li, Pritesh Kanani, Ross Cutler, Johannes Gehrke:
Lumos: A Library for Diagnosing Metric Regressions in Web-Scale Applications. CoRR abs/2006.12793 (2020)
2010 – 2019
- 2019
- [j35]Binlong Li, Liming Xiong, Jun Yin:
Large degree vertices in longest cycles of graphs, II. Electron. J. Graph Theory Appl. 7(2): 277-299 (2019) - [j34]John Gimbel, André Kündgen
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. SIAM J. Discret. Math. 33(3): 1415-1430 (2019) - 2018
- [j33]Pengfei Wan, Jianhua Tu
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. Appl. Math. Comput. 332: 42-47 (2018) - [j32]Binlong Li, Hajo Broersma
Conditions for graphs to be path partition optimal. Discret. Math. 341(5): 1350-1358 (2018) - [j31]Binlong Li, Bo Ning
Extremal problems on the Hamiltonicity of claw-free graphs. Discret. Math. 341(10): 2774-2788 (2018) - 2017
- [j30]Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le, Binlong Li, Nicolas Lichiardopol:
Disjoint Cycles of Different Lengths in Graphs and Digraphs. Electron. J. Comb. 24(4): 4 (2017) - [j29]Junfeng Du, Binlong Li, Liming Xiong
Forbidden pairs of disconnected graphs for traceability in connected graphs. Discret. Math. 340(9): 2194-2199 (2017) - [j28]Binlong Li, Bo Ning
Heavy subgraphs, stability and Hamiltonicity. Discuss. Math. Graph Theory 37(3): 691-710 (2017) - [j27]André Kündgen
Cycles through all finite vertex sets in infinite graphs. Eur. J. Comb. 65: 259-275 (2017) - [j26]Binlong Li, Yanbo Zhang
An Exact Formula for all Star-Kipas Ramsey Numbers. Graphs Comb. 33(1): 141-148 (2017) - [j25]Binlong Li, Petr Vrána:
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity. J. Graph Theory 84(3): 249-261 (2017) - 2016
- [j24]Xiaogang Liu
Distance powers of unitary Cayley graphs. Appl. Math. Comput. 289: 272-280 (2016) - [j23]Yandong Bai
Universal arcs in tournaments. Discret. Math. 339(8): 2063-2065 (2016) - [j22]Binlong Li, Liming Xiong, Jun Yin:
Large degree vertices in longest cycles of graphs, I. Discuss. Math. Graph Theory 36(2): 363-382 (2016) - [j21]Binlong Li, Shenggui Zhang:
Heavy subgraph conditions for longest cycles to be heavy in graphs. Discuss. Math. Graph Theory 36(2): 383-392 (2016) - [j20]Hajo Broersma
Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discuss. Math. Graph Theory 36(4): 915-929 (2016) - [j19]Binlong Li, Bo Ning
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. Graphs Comb. 32(1): 279-295 (2016) - [j18]Binlong Li, Ingo Schiermeyer:
On Star-Wheel Ramsey Numbers. Graphs Comb. 32(2): 733-739 (2016) - [j17]Bo Ning
Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. Graphs Comb. 32(3): 1125-1135 (2016) - [j16]Binlong Li, Halina Bielak:
On the Ramsey-Goodness of Paths. Graphs Comb. 32(6): 2541-2549 (2016) - 2015
- [j15]Binlong Li, Yanbo Zhang
Closing the Gap on Path-Kipas Ramsey Numbers. Electron. J. Comb. 22(3): 3 (2015) - [j14]Chuandong Xu, Shenggui Zhang, Bo Ning
A note on the number of spanning trees of line digraphs. Discret. Math. 338(5): 688-694 (2015) - [j13]Yandong Bai
Vertex-disjoint cycles in bipartite tournaments. Discret. Math. 338(8): 1307-1309 (2015) - [j12]Binlong Li, Shenggui Zhang:
Forbidden subgraphs for longest cycles to contain vertices with large degrees. Discret. Math. 338(10): 1681-1689 (2015) - [j11]Binlong Li, Bo Ning
Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs Comb. 31(3): 649-667 (2015) - 2014
- [j10]Binlong Li, Bo Ning:
The Ramsey Numbers of Paths Versus Wheels: a Complete Solution. Electron. J. Comb. 21(4): 4 (2014) - [j9]Hajo Broersma
Heavy subgraph pairs for traceability of block-chains. Discuss. Math. Graph Theory 34(2): 287-307 (2014) - [j8]Binlong Li, Bo Ning
Rainbow triangles in edge-colored graphs. Eur. J. Comb. 36: 453-459 (2014) - 2013
- [j7]Binlong Li, Hajo Broersma
Forbidden subgraph pairs for traceability of block-chains. Electron. J. Graph Theory Appl. 1(1): 1-10 (2013) - 2012
- [j6]Binlong Li, Shenggui Zhang:
Notes on heavy cycles in weighted digraphs. Appl. Math. Lett. 25(11): 1629-1631 (2012) - [j5]Yandong Bai
Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. Discret. Math. 312(10): 1596-1601 (2012) - [j4]Binlong Li, Hajo Broersma
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discret. Math. 312(18): 2800-2818 (2012) - [j3]Binlong Li, Zdenek Ryjácek, Ying Wang, Shenggui Zhang:
Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs. SIAM J. Discret. Math. 26(3): 1088-1103 (2012) - [c3]Binlong Li, Octavia I. Camps, Mario Sznaier:
Cross-view activity recognition using Hankelets. CVPR 2012: 1362-1369 - 2011
- [j2]Binlong Li, Shenggui Zhang:
Heavy cycles and spanning trees with few leaves in weighted graphs. Appl. Math. Lett. 24(6): 908-910 (2011) - [c2]Binlong Li, Mustafa Ayazoglu, Teresa Mao, Octavia I. Camps, Mario Sznaier:
Activity recognition using dynamic subspace angles. CVPR 2011: 3193-3200 - [c1]Mustafa Ayazoglu, Binlong Li, Caglayan Dicle, Mario Sznaier, Octavia I. Camps:
Dynamic subspace-based coordinated multicamera tracking. ICCV 2011: 2462-2469 - 2010
- [j1]Binlong Li, Shenggui Zhang:
On extremal weighted digraphs with no heavy paths. Discret. Math. 310(10-11): 1640-1644 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: