{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:00:25Z","timestamp":1767988825159,"version":"3.49.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $t,q$ and $n$ be positive integers. Write $[q] = \\{1,2,\\ldots,q\\}$. The generalized Hamming graph $H(t,q,n)$ is the graph whose vertex set is the cartesian product of $n$ copies of $[q]$ $(q\\ge 2)$, where two vertices are adjacent if their Hamming distance is at most $t$. In particular, $H(1,q,n)$ is the well-known Hamming graph and $H(1,2,n)$ is the hypercube. In 2006, Chandran and Kavitha described the asymptotic value of $tw(H(1,q,n))$, where $tw(G)$ denotes the treewidth of $G$. In this paper, we give the exact pathwidth of $H(t,2,n)$ and show that $tw(H(t,q,n)) = \\Theta(tq^n\/\\sqrt{n})$ when $n$ goes to infinity. Based on those results, we show that the treewidth of bipartite Kneser graph $BK(n,k)$ is $\\binom{n}{k} - 1$ when $n$ is sufficient large relative to $k$ and the bounds of $tw(BK(2k+1,k))$ are given. Moreover, we present the bounds of the treewidth of generalized Petersen graph.<\/jats:p>","DOI":"10.37236\/12892","type":"journal-article","created":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:32:33Z","timestamp":1767969153000},"source":"Crossref","is-referenced-by-count":0,"title":["Treewidth of Generalized Hamming Graph, Bipartite Kneser Graph and Generalized Petersen Graph"],"prefix":"10.37236","volume":"33","author":[{"given":"Yichen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Mengyu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Zequn","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2026,1,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:32:33Z","timestamp":1767969153000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i1p7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,9]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/12892","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,9]]},"article-number":"P1.7"}}