Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.