9 citations · 19 across the 15 of their papers we have counts for
15 papers
Binding Number, Toughness and General Matching Extendability in Graphs
Hongliang Lu, Qinglin Yu
A connected graph with at least vertices which contains a perfect matching is -{\it extendable}, if for any two sets of disjoint independent edges an…
On Murty-Simon Conjecture II
Tao Wang, Ping Wang, Qinglin Yu
A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter…
On the Existence of General Factors in Regular Graphs
Hongliang Lu, David G. L. Wang, Qinglin Yu
Let be a graph, and a set function associated with . A spanning subgraph of is called an -factor if the degree of any vertex in…
An Alternative Proof of the -Factor Theorem
Hongliang Lu, Qinglin Yu
Let be a set mapping for a graph . Given a spanning subgraph of , is called a {\it general factor} or an -{\it factor} of …
Vertex-Coloring 2-Edge-Weighting of Graphs
Hongliang Lu, Qinglin Yu, Cun-Quan Zhang
A -{\it edge-weighting} of a graph is an assignment of an integer weight, , to each edge . An edge weighting naturally induces a vertex colori…
L-factors and adjacent vertex-distinguishing edge-weighting
Yinghua Duan, Hongliang Lu, Qinglin yu
An edge weighting problem of a graph G is an assignment of an integer weight to each edge e. Based on edge weighting problem, several types of vertex-coloring problems are put forw…