activity
20102026
most citedA better bound on the size of rainbow matchings

9 citations · 37 across the 47 of their papers we have counts for

collaborators
Showing 2011Show all

6 papers · 1 filter

math.CO2011

A Note on -Factors of Regular Graphs

Hongliang Lu, David G. L. Wang

Let be an odd integer, and an even integer. In this note, we present -regular graphs which have no -factors for all . This gives a nega…

math.CO2011★ 1 cited

Note on parity factors of regular graphs

Hongliang Lu

In this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is s…

math.CO2011

On Cui-Kano's Characterization Problem on Graph Factors

H. L. Lu, David G. L. Wang

An -factor of a graph is defined to be a spanning subgraph of such that each vertex has degree belonging to the set in . In this paper,…

math.CO2011

Maximum spectral radius of graphs with given connectivity and minimum degree

Hongliang Lu, Yuqing Lin

Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most , J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order with $κ…

math.CO2011

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 …

math.CO2011★ 5 cited

Simplified existence theorems on all fractional [a,b]-factors

Hongliang Lu

Let be a graph with order and let such that for all . We say that has all fractional -factors if has…