79 citations · 217 across the 44 of their papers we have counts for
5 papers · 2 filters
On heavy paths in 2-connected weighted graphs
Binlong Li, Shenggui Zhang
A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the we…
Long paths and cycles passing through specified vertices under the average degree condition
Binlong Li, Bo Ning, Shenggui Zhang
Let be a -connected graph with . In this paper we first prove that: For two distinct vertices and in , it contains a path passing through its any {…
Pairs of heavy subgraphs for Hamiltonicity of 2-connected graphs
Binlong Li, Zdeněk Ryjáček, Ying Wang +1
Let be a graph on vertices. An induced subgraph of is called heavy if there exist two nonadjacent vertices in with degree sum at least in . We say that $…
A note on heavy cycles in weighted digraphs
Binlong Li, Shenggui Zhang
A weighted digraph is a digraph such that every arc is assigned a nonnegative number, called the weight of the arc. The weighted outdegree of a vertex in a weighted digraph …
Covering the edges of digraphs in and with directed cuts
Yandong Bai, Binlong Li, Shenggui Zhang
For nonnegative integers and , let denote the family of digraphs in which every vertex has either indegree at most or outdegree at most . In this p…