Closed trail decompositions on grid graphs

Research output: Contribution to journalArticlepeer-review

39 Downloads (Pure)

Abstract

Let G = G(n,m) be a rectangular solid grid graph and A(G) be a minimum length Eulerian augmentation of G. Let l0, . . . , lt ∈ N such that Σt i=0 li = |E(A(G)|, where 2(n + m) ≤ li = 2ki. In this paper, we exhibit a constructive procedure providing an edge-disjoint decomposition of A(G) into closed trails T0, . . . , Tt such that |E(Ti)| = li.
Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalPure Mathematics and Applications
Volume28
Issue number1
DOIs
Publication statusPublished - 27 Jul 2021

Keywords

  • closed trail
  • graph decomposition
  • grid graphs

Fingerprint

Dive into the research topics of 'Closed trail decompositions on grid graphs'. Together they form a unique fingerprint.

Cite this