Showing 2026Show all
2 papers · 1 filter
math.CO2026
The diameter of recoloring graphs under a maximum average degree bound
Ruilin Zheng, Junying Lu
For a graph , we write for its maximum average degree and for its diameter. Let be the graph whose vertices are the proper colorings…
math.CO2026
Two-block cycles and chromatic number of Hamiltonian digraphs
Ruilin Zheng, Junying Lu, Xiaolin Wang +1
Let and be positive integers. The family consists of all digraphs obtained from two internally vertex-disjoint directed paths of lengths at least and $\e…