From the 2 of 5 linked papers with an AI index.
5 papers · 1 filter
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 be the set of odd cycle lengths of a…
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.
A note on long nontrivial cycle in Hamiltonian graphs
Xiaolin Wang, Jiabao Yang, Guangmiao Yu +1
Let be an -vertex graph containing a Hamiltonian cycle and with minimum degree at least . Girão, Kittipassorn and Narayanan (Israel J. Math., 2019) proved that conta…
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 -vertex -free graph can have. The suspension is obtained from by adding a new vertex whi…
Improved bound on the number of edges of diameter--critical graphs
Xiaolin Wang, Yanbo Zhang, Xiutao Zhu
A graph is diameter--critical if its diameter equals and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical…