A. Lo

most citedA note on the minimum size of

k

-rainbow connected graphs

11 citations · 18 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2015★ 7 cited

Existences of rainbow matchings and rainbow matching covers

Allan Lo

Let $G$ be an edge-coloured graph. A rainbow subgraph in $G$ is a subgraph such that its edges have distinct colours. The minimum colour degree $δ^{c} (G)$ of $G$ is the smallest numb…

math.CO2015★ 11 cited

A note on the minimum size of $k$ -rainbow connected graphs

Allan Lo

An edge-coloured graph $G$ is rainbow connected if there exists a rainbow path between any two vertices. A graph $G$ is said to be $k$ -rainbow connected if there exists an edge-col…

math.CO2012

A note on large rainbow matchings in edge-coloured graphs

Allan Lo, Ta Sheng Tan

A rainbow subgraph in an edge-coloured graph is a subgraph such that its edges have distinct colours. The minimum colour degree of a graph is the smallest number of distinct colour…

Existences of rainbow matchings and rainbow matching covers

A note on the minimum size of k-rainbow connected graphs

A note on large rainbow matchings in edge-coloured graphs

A note on the minimum size of $k$ -rainbow connected graphs