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

3 papers · 1 filter

math.CO2013★ 1 cited

Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights

Hongliang Lu

Let $G$ be a graph and $S$ be a subset of $Z$ . A vertex-coloring $S$ -edge-weighting of $G$ is an assignment of weight $s$ by the elements of $S$ to…

math.CO2013

A Note On Edge Connectivity and Parity Factor

Hongliang Lu

In this paper, we investigate some parity factors by using Lovász's (g,f)-parity theorem. Let $m > 0$ be an integer. Firstly, we obtain a sufficient and necessary condition for some…

math.CO2013★ 2 cited

An Extension of Cui-Kano's Characterization Problem on Graph Factors

Hongliang Lu

Let $G$ be a graph with vertex set $V (G)$ and let $H : V (G) \to 2^{N}$ be a set function associating with $G$ . An $H$ -factor of graph $G$ is a spanning subgraphs $F$ such that $…