On the dispersability of graph bundles over cycles
Combinatorics
2024-05-28 v1
Abstract
In this paper, the dispersability of the Cartesian graph bundle over two cycles is completely solved. We show the Cartesian graph bundle over two cycles is dispersable if is bipartite; otherwise, is nearly dispersable.
Cite
@article{arxiv.2405.16253,
title = {On the dispersability of graph bundles over cycles},
author = {Zeling Shao and Xiaoxiang Yu and Zhiguo Li},
journal= {arXiv preprint arXiv:2405.16253},
year = {2024}
}
Comments
arXiv admin note: text overlap with arXiv:2310.06612