Decomposition of toroidal graphs without some subgraphs
Combinatorics
2025-02-27 v1
Abstract
We consider a family of toroidal graphs, denoted by , which contain neither -cycles nor -cycles. A graph is -decomposable if it contains a subgraph with such that is a -degenerate graph. For each pair , Lu and Li proved that every graph in is -decomposable. In this short note, we present a unified approach to prove that a common superclass of is also -decomposable.
Keywords
Cite
@article{arxiv.2502.18945,
title = {Decomposition of toroidal graphs without some subgraphs},
author = {Tao Wang and Xiaojing Yang},
journal= {arXiv preprint arXiv:2502.18945},
year = {2025}
}
Comments
8 pages, 7 figures