English

Decomposition of toroidal graphs without some subgraphs

Combinatorics 2025-02-27 v1

Abstract

We consider a family of toroidal graphs, denoted by Ti,j\mathcal{T}_{i, j}, which contain neither ii-cycles nor jj-cycles. A graph GG is (d,h)(d, h)-decomposable if it contains a subgraph HH with Δ(H)h\Delta(H) \leq h such that GE(H)G - E(H) is a dd-degenerate graph. For each pair (i,j){(3,4),(3,6),(4,6),(4,7)}(i, j) \in \{(3, 4), (3, 6), (4, 6), (4, 7)\}, Lu and Li proved that every graph in Ti,j\mathcal{T}_{i, j} is (2,1)(2, 1)-decomposable. In this short note, we present a unified approach to prove that a common superclass of Ti,j\mathcal{T}_{i, j} is also (2,1)(2, 1)-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

R2 v1 2026-06-28T21:58:24.538Z