Weichan Liu

collaborators

2 papers

math.CO2022

Hypergraph incidence coloring

Weichan Liu, Guiying Yan

An incidence of a hypergraph $H = (X, S)$ is a pair $(x, s)$ with $x \in X$ , $s \in S$ and $x \in s$ . Two incidences $(x, s)$ and $(x^{'}, s^{'})$ are adjacent if (i) $x = x^{'}$ , or (ii) $\…

math.CO2017

A note on the vertex arboricity of signed graphs

Weichan Liu, Chen Gong, Lifang Wu +1

A signed tree-coloring of a signed graph $(G, σ)$ is a vertex coloring $c$ so that $G^{c} (i, \pm)$ is a forest for every $i \in c (u)$ and $u \in V (G)$ , where $G^{c} (i, \pm)$ is the subg…