Xiaolan Hu

collaborators

2 papers

math.CO2026

The strong fractional choice number of triangle-free planar graphs

Xiaolan Hu, Rongxing Xu

Let $a, b$ be positive integers with $a \geq b$ . A graph $G$ is $(a, b)$ -choosable if, for every assignment of lists $L (v)$ of size $a$ to the vertices of $G$ , there exists a choice of…

math.CO2025

Fractional balanced chromatic number of signed subcubic graphs

Xiaolan Hu, Luis Kuffner, Jiaao Li +4

A signed graph is a pair $(G, I ¨ )$ , where $G$ is a graph and $I ¨ : E (G) \to {-, +}$ , called signature, is an assignment of signs to the edges. Given a signed graph $(G, I ¨ )$ …