Decomposition of toroidal graphs without some subgraphs
Abstract
We consider a family of toroidal graphs, denoted by Ti, j, which contain neither i-cycles nor j-cycles. A graph G is (d, h)-decomposable if it contains a subgraph H with (H) ≤ h such that G - E(H) is a d-degenerate graph. For each pair (i, j) ∈ \(3, 4), (3, 6), (4, 6), (4, 7)\, Lu and Li proved that every graph in Ti, j is (2, 1)-decomposable. In this short note, we present a unified approach to prove that a common superclass of Ti, j is also (2, 1)-decomposable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.