{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:44:17Z","timestamp":1767339857863,"version":"3.41.2"},"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>A queue layout of a graph consists of a linear order on the vertices and an assignment of the edges to queues, such that no two edges in a single queue are nested.\u00a0The minimum number of queues needed in a queue layout of a graph is called its queue-number.\u00a0We show that for each $k\\geq0$, graphs with tree-width at most $k$ have queue-number at most $2^k-1$.\u00a0This improves upon double exponential upper bounds due to Dujmovi\u0107 et al. and Giacomo et al.\u00a0As a consequence we obtain that these graphs have track-number at most $2^{O(k^2)}$.\u00a0We complement these results by a construction of $k$-trees that have queue-number at least $k+1$.\u00a0Already in the case $k=2$ this is an improvement to existing results and solves a problem of Rengarajan and Veni Madhavan, namely, that the maximal queue-number of $2$-trees is equal to $3$.<\/jats:p>","DOI":"10.37236\/6429","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:58:51Z","timestamp":1578671931000},"source":"Crossref","is-referenced-by-count":16,"title":["On the Queue-Number of Graphs with Bounded Tree-Width"],"prefix":"10.37236","volume":"24","author":[{"given":"Veit","family":"Wiechert","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2017,3,31]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p65\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p65\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T05:02:59Z","timestamp":1579237379000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/doi.org\/10.37236\/6429","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,3,31]]},"article-number":"P1.65"}}