Xiaolin Wang

works on

chromatic number 1 digraphs 1 forbidden subgraphs 1 hamiltonian cycles 1 two-block cycles 1

From the 2 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

Odd and even cycle lengths, minimum degree and chromatic number in graphs

Xiaolin Wang, Meiduo Chen, Xueping Xu

We present the relations between clique number and chromatic number with given the number of odd or even or all cycle lengths. Let $L_{o} (G)$ be the set of odd cycle lengths of $G$ a…

math.CO2026

Two-block cycles and chromatic number of Hamiltonian digraphs

Ruilin Zheng, Junying Lu, Xiaolin Wang +1

The paper proves that any Hamiltonian digraph avoiding a two‑block cycle C(k,ℓ) has chromatic number at most k + ℓ − 1 for k + ℓ ≥ 6, confirming a conjectured bound.

math.CO2026

A note on long nontrivial cycle in Hamiltonian graphs

Xiaolin Wang, Jiabao Yang, Guangmiao Yu +1

Let $G$ be an $n$ -vertex graph containing a Hamiltonian cycle and with minimum degree at least $3$ . GirÃ£o, Kittipassorn and Narayanan (Israel J. Math., 2019) proved that $G$ conta…

math.CO2025

TurÃ¡n problems for suspension of a balanced tree

Xiutao Zhu, Xiaolin Wang, Yanbo Zhang +1

The TurÃ¡n number $\ex(n,H)$ is the maximum number of edges that an $n$ -vertex $H$ -free graph can have. The suspension $H$ is obtained from $H$ by adding a new vertex whi…