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

4 papers · 1 filter

math.CO2015

A Tutte-type characterization for graph factors

Hongliang Lu, David G. L. Wang

Let $G$ be a connected general graph. Let $f : V (G) \to Z^{+}$ be a function. We show that $G$ satisfies the Tutte-type condition \[ o(G-S)\le f(S)\qquad\text{for all vertex subs…

math.CO2015

Antifactors of regular bipartite graphs

Hongliang Lu, Wei Wang, Juan Yan

Let $G = (X, Y; E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$ . Lovász and Plummer \cite{LoPl86} asked whether one can decide in polyn…

math.CO2015

The maximum number of perfect matchings of semi-regular graphs

Hongliang Lu, David G. L. Wang

Let $n \geq 34$ be an even integer, and $D_{n} = 2 ⌈ n /4 ⌉ - 1$ . In this paper, we prove that every ${D_{n}, D_{n} + 1}$ -graph of order $n$ contains $⌈ n /4 ⌉$ disjoint perf…

math.CO2015

Surface embedding of non-bipartite $k$ -extendable graphs

Hongliang Lu, David G. L. Wang

We find the minimum number $k = μ^{'} (Σ)$ for any surface $Σ$ , such that every $Σ$ -embeddable non-bipartite graph is not $k$ -extendable. In particular, we construct the so-called bow-ti…

A Tutte-type characterization for graph factors

Antifactors of regular bipartite graphs

The maximum number of perfect matchings of semi-regular graphs

Surface embedding of non-bipartite k-extendable graphs

Surface embedding of non-bipartite $k$ -extendable graphs