Xiaolan Hu

activity

20182026

collaborators

Showing math.COShow all

11 papers · 1 filter

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…

math.CO2021

The fractional chromatic number of $K_{Δ}$ -free graphs

Xiaolan Hu, Xing Peng

For a simple graph $G$ , let $χ_{f} (G)$ be the fractional chromatic number of $G$ . In this paper, we aim to establish upper bounds on $χ_{f} (G)$ for those graphs $G$ with restrictions o…

math.CO2020

Circular Coloring and Fractional Coloring in Planar Graphs

Xiaolan Hu, Jiaao Li

We study the following Steinberg-type problem on circular coloring: for an odd integer $k \geq 3$ , what is the smallest number $f (k)$ such that every planar graph of girth $k$ withou…

math.CO2018

Fractional coloring of planar graphs of girth five

Zdeněk Dvořák, Xiaolan Hu

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first sh…