Xiaolan Hu

collaborators

3 papers

math.CO2026

Extremal number of edges in graphs without homeomorphically irreducible spanning trees

Yibo Li, Huiqing Liu, Xiaolan Hu

For integers $k \geq 1$ and $n \geq k + 1$ , let $ex_{k}^{HIST} (n)$ denote the maximum number of edges in a $k$ -connected graph of order $n$ which contains no homeom…

math.CO2026

Rainbow spanning structures in strongly edge-colored graphs

Laihao Ding, Xiaolan Hu, Suyun Jiang

An edge-colored graph is a graph in which each edge is assigned a color. Such a graph is called strongly edge-colored if each color class forms an induced matching, and called rain…

math.CO2024

A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices

Yibo Li, Fengming Dong, Xiaolan Hu +1

For a connected graph $G$ , a spanning tree $T$ of $G$ is called a homeomorphically irreducible spanning tree (HIST) if $T$ has no vertices of degree $2$ . In this paper, we show tha…

Extremal number of edges in graphs without homeomorphically irreducible spanning trees

Rainbow spanning structures in strongly edge-colored graphs

A neighborhood union condition for the existence of a spanning tree without degree 2 vertices

A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices