Hongliang Lu

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 2010Show all

4 papers · 1 filter

math.CO2010

Vertex-deleted subgraphs and regular factors from regular graph

Hongliang Lu, Bing Bai, Wei Wang

Let $k$ , $m$ and $r$ be three integers such that $2 \leq k \leq m \leq r$ . Let $G$ be a $2 r$ -regular, $2 m$ -edge-connected graph of odd order. We obtain some sufficient conditions, whi…

math.CO2010★ 1 cited

Vertex-Coloring 2-Edge-Weighting of Graphs

Hongliang Lu, Qinglin Yu, Cun-Quan Zhang

A $k$ -{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w (e) \in {1, \dots, k}$ , to each edge $e$ . An edge weighting naturally induces a vertex colori…

math.CO2010

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…

math.CO2010

Regular factors of regular graphs from eigenvalues

Hongliang Lu

Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on…