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

4 papers · 1 filter

math.CO2017

Minimum co-degree condition for perfect matchings in k-partite k-graphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $H$ be a $k$ -partite $k$ -graph with $n$ vertices in each partition class, and let $δ_{k - 1} (H)$ denote the minimum co-degree of $H$ . We characterize those $H$ with $δ_{k-1}(H) \…

math.CO2017★ 1 cited

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings

Hongliang Lu, Bo Ning

Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent…

math.CO2017

The Complexity of All $(g, f)$ -Factor Problem

Hongliang Lu

Let $G$ be a graph with vertex set $V$ and let $g, f : V \to Z^{+}$ be two functions such that $g \leq f$ . We say that $G$ has all $(g, f)$ -factors if $G$ has an $h$ -f…

math.CO2017★ 2 cited

Characterization of 1-Tough Graphs using Factors

M. Kano, H. Lu

For a graph $G$ , let $o dd (G)$ and $ω (G)$ denote the number of odd components and the number of components of $G$ , respectively. Then it is well-known that $G$ has a 1-factor if and…

Minimum co-degree condition for perfect matchings in k-partite k-graphs

An Ore-type Condition for Large k-factor and Disjoint Perfect Matchings

The Complexity of All (g,f)-Factor Problem

Characterization of 1-Tough Graphs using Factors

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings

The Complexity of All $(g, f)$ -Factor Problem