2000 character limit reached
Decomposition of toroidal graphs without some subgraphs
Published 26 Feb 2025 in math.CO | (2502.18945v1)
Abstract: We consider a family of toroidal graphs, denoted by $\mathcal{T}{i, j}$, which contain neither $i$-cycles nor $j$-cycles. A graph $G$ is $(d, h)$-decomposable if it contains a subgraph $H$ with $\Delta(H) \leq h$ such that $G - E(H)$ is a $d$-degenerate graph. For each pair $(i, j) \in {(3, 4), (3, 6), (4, 6), (4, 7)}$, Lu and Li proved that every graph in $\mathcal{T}{i, j}$ is $(2, 1)$-decomposable. In this short note, we present a unified approach to prove that a common superclass of $\mathcal{T}_{i, j}$ is also $(2, 1)$-decomposable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.