Xuli Qi

activity

20132026

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Edge-chromatic $4$ -critical graphs and Overfull Conjecture for graphs with maximum degree $4$

Chunhui Ge, Gregory Gutin, Xuli Qi

Let $G$ be a simple graph with maximum degree $Δ (G)$ and chromatic index $χ^{'} (G)$ . A graph $G$ is called edge-chromatic $Δ$ -critical if $χ^{'} (G) = Δ (G) + 1$ and $χ^{'} (H) < χ^{'} (G)$ for every p…

math.CO2026

On distance spectral radius of power hypertrees with given number of pendant paths of fixed length

Yanna Wang, Xuli Qi

The distance spectral radius of a connected hypergraph is the largest eigenvalue of the distance matrix of the hypergraph. A pendant path of length l with l greater than or equal t…

math.CO2026

On the Hilton-Zhao vertex-splitting conjecture

Xuli Qi, Yanrui Feng

Let $G$ be a simple graph with order $n$ , maximum degree $Δ (G)$ , and chromatic index $χ^{'} (G)$ , respectively. A graph $G$ is edge-chromatic critical if $χ^{'} (H) < χ^{'} (G)$ for every proper…

math.CO2026

The average distance of spanning trees in terms of independence number

Zhibin Du, Xuli Qi

Let $G$ be a connected graph with vertex set $V (G)$ , and denote by $d_{G} (u, v)$ the distance from $u$ to $v$ in $G$ , for any $u, v \in V (G)$ . The average distance of an $n$ -vertex con…

Edge-chromatic 4-critical graphs and Overfull Conjecture for graphs with maximum degree 4

On distance spectral radius of power hypertrees with given number of pendant paths of fixed length

On the Hilton-Zhao vertex-splitting conjecture

The average distance of spanning trees in terms of independence number

Edge-chromatic $4$ -critical graphs and Overfull Conjecture for graphs with maximum degree $4$