Pith. sign in

REVIEW 2 major objections 5 minor 27 references

The Peculiarities of Extending Queue Layouts

T0 review · 2 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper establishes a complete parameterized complexity map for the Queue Layout Extension problem, showing it is NP-complete with all vertices fixed, W[1]-hard in the number of missing elements, fixed-parameter tractable when page…

desk verdict New complexity map for queue layout extension, but the FPT theorem's 2-SAT lemma has a real gap that needs fixing. read the letter →

arxiv 2506.05156 v1 pith:WESM7FIP submitted 2025-06-05 cs.CG cs.DS

Thomas Depian , Simon D. Fink , Robert Ganian , Martin Nöllenburg This is my paper
classification cs.CGcs.DS MSC 68Q2768R1068Q25
keywords QueuelayoutsParameterizedcomplexityExtensionproblemsLinearPermutationgraphs2-SATFixed-parametertractabilitynumber
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks how hard it is to finish a partially drawn queue layout: some vertices and edges already sit on a spine and are assigned to pages, and the task is to insert the missing vertices and edges so that no page contains two nested edges. It claims a full complexity map for this problem. With the spine fixed, deciding extendability is already NP-complete, but fixing only the missing edges makes it fixed-parameter tractable in their number. Counting both missing vertices and missing edges gives W[1]-hardness, so no fixed-parameter algorithm is expected; adding the number of pages to the parameter restores fixed-parameter tractability. Notably, when exactly two vertices are missing the problem becomes polynomial-time solvable, in direct contrast to the analogous stack-layout extension problem, which is NP-hard in that setting.

What carries the argument

The argument runs through several constructions. First, the conflict graph C(G,≺) — vertices are edges of G, adjacency means the two edges nest in the spine order — is shown to be a permutation graph, so assigning edges to pages with a fixed spine order is exactly coloring that permutation graph, and extending a layout is precoloring extension. For the hardness lower bound, two gadgets on the spine, an edge gadget and a fixation gadget, force each new vertex to land in the interval corresponding to a vertex of the right color and force adjacency to match the input graph's edges. For the FPT result, Observation 15 turns the non-nesting condition into biconditional clauses, and Lemma 16 packages the whole spine-placement problem as a 2-SAT instance whose clauses stay binary because old and guessed orders fix at least two positions in every triple. For the two-vertex case, Lemmas 18–21 supply reduction rules using visibility sets P(e) to delete edges with at least two admissible pages without changing solvability.

What would settle it

Enumerate all spine orders for a small instance with three new vertices, none incident to a missing edge, and compare the answer of Lemma 16's 2-SAT formula with brute-force extendability; a mismatch in either direction would refute the lemma. A more direct test is to exhibit a triple in which no two elements are ordered by ≺H or ≺Eadd, forcing a three-literal transitivity clause and breaking the claimed 2-CNF encoding.

Watch

Extended reading notes

Core claim

The paper's central claim is that Queue Layout Extension (QLE) — linear arrangement of vertices plus page assignment avoiding nested edges, given a partial such layout to extend — has the following exact complexity classification: NP-complete when all vertices are present but edges may be missing; in XP but W[1]-hard when parameterized by the total number of missing elements; fixed-parameter tractable when the parameter is the number of pages plus the number of missing elements; and polynomial-time solvable when the partial layout is missing exactly two vertices. The two-vertex result is the paper's headline contrast with stack layouts, where the corresponding restriction is NP-hard.

Load-bearing premise

The FPT algorithm in Theorem 5 rests on Lemma 16's claim that for every triple of vertices, the relative order of at least two is already pinned down by the old spine order or the guessed order of new-edge endpoints, so transitivity constraints never require a clause with three literals; the paper does not give a full case analysis, especially for vertices that are not endpoints of any new edge.

Editorial extensions

If this is right

  • For graphs whose vertex order is already fixed, extending a queue layout by missing edges is NP-complete but fixed-parameter tractable in the number of missing edges.
  • When both vertices and edges may be missing, the problem is W[1]-hard in the number of missing elements, ruling out an FPT algorithm for that parameter under the standard complexity hypothesis.
  • Including the number of pages in the parameter makes the problem fixed-parameter tractable, so the combined parameter gives the first positive algorithmic handle on general missing vertices and edges.
  • With exactly two missing vertices, extendability is decidable in polynomial time even though the number of missing edges is unbounded, giving the first concrete separation from stack-layout extension in the same setting.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If Lemma 16's structural assertion is made fully explicit, a likely consequence is that the same 2-SAT framework handles partial page assignments where only some edges' colors are prescribed, not just full subgraph layouts.
  • The contrast with stacks suggests that extension complexity is not a single property of linear layouts; each layout style's local forbidden configuration (nesting versus crossing) creates its own algorithmic boundary, so results for queue and stack layouts should not be assumed to transfer to track layouts or other linear drawing styles.
  • A natural testable extension is whether the two-vertex polynomial algorithm generalizes to a constant number of missing vertices; if the visibility reduction rules survive, QLE may be in XP parameterized by the number of missing vertices alone, without the page count.
  • The permutation-graph equivalence means any future improvement in coloring or list-coloring permutation graphs would immediately improve algorithms for queue-layout extension with fixed spine order; the paper already imports NP-completeness and XP membership from that direction.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper studies Queue Layout Extension (QLE), the problem of extending a partial ℓ-page queue layout of a subgraph H to a full layout of a supergraph G. The main contribution is a complexity map for QLE: NP-completeness when only edges are missing but all vertices are fixed (Theorem 1), fixed-parameter tractability in the number of missing edges in that setting (Theorem 2), membership in XP parameterized by the number κ of missing vertices and edges (Theorem 3), W[1]-hardness parameterized by κ (Theorem 4), fixed-parameter tractability parameterized by κ plus the number of pages ℓ (Theorem 5), and polynomial-time solvability when exactly two vertices are missing (Theorem 6). The paper stresses the contrasts with the analogous stack-layout extension problem, particularly the polynomial-time two-vertex case versus NP-hardness for stack layouts.

Significance. If all results are correct, the paper provides a essentially complete parameterized complexity classification of QLE and identifies several genuinely surprising distinctions between queue and stack layout extension. The W[1]-hardness reduction from Multicolored Clique is developed in considerable detail, and the appendix removing multi-edges addresses a real technical obstacle rather than leaving it as an assumption. The two-vertex polynomial-time result is a particularly clean and non-obvious contrast with the stack-layout setting. However, the proof of Theorem 5 rests on Lemma 16, and as written that lemma has correctness gaps in the 2-SAT encoding; since Theorem 5 is one of the three headline results, the classification is not yet fully supported.

major comments (2)
  1. [Section 5, Lemma 16] The 2-SAT formula does not enforce totality. The subformula φ1 is ⋀_{u≠v} ((x_{u,v}⇒¬x_{v,u}) ∧ (x_{v,u}⇒¬x_{u,v})), which is equivalent to ⋀_{u≠v} (¬x_{u,v} ∨ ¬x_{v,u}); in particular, an assignment with x_{u,v}=x_{v,u}=0 satisfies φ1. The proof's (⇒)-direction nevertheless asserts that 'exactly one of these cases is true' when constructing ≺G from a satisfying assignment. Without totality, the assignment does not determine a spine order, so the claimed equivalence between satisfiability of φ and existence of a solution is not established. This is not a cosmetic omission: it is exactly the step that converts a satisfying assignment into a total order on V(G).
  2. [Section 5, Lemma 16 (transitivity)] The proof does not include transitivity clauses in φ, and the argument that they are unnecessary is not valid. The claim that for every triple u,v,w the relative order of at least two of them is fixed by ≺H or ≺Eadd is asserted without a case analysis and is false as stated for new vertices that are not endpoints of any new edge and hence do not appear in ≺Eadd; with two such vertices and one old vertex, no pair order is fixed, and with three such vertices the clause ¬x_{u,v} ∨ ¬x_{v,w} ∨ x_{u,w} is an irreducible 3-CNF clause. Moreover, even when a pair's order is fixed, the reduced clause is not automatically among φ1–φ4 unless the transitivity clauses are explicitly added to the formula. Because transitivity is missing, a satisfying assignment may contain directed cycles such as x_{u,v}=x_{v,w}=x_{w,u}=1 while satisfying all φ1 clauses; the proof's instruction to 'take the transitive closure' is then not legitimate, since closing a cyclic relation destroys antisymmetry. Since Lemma 16 supplies the polynomial verification step inside Theorem 5, the proof of Theorem 5 is incomplete as written.
minor comments (5)
  1. [Section 3, Lemma 7] In the proof of Lemma 7, the final conclusion of the argument for F′ is stated as ac∉F′, but the argument actually shows as≺cs and ae≺ce, so the complement edge ac should lie in F′; the conclusion should be ac∈F′.
  2. [Section 6, Lemma 21] The instance notation in the statement of Lemma 21 contains a typo: 'I′=(ℓ,H,G′=G\{e},⟨≺,σ⟩)' should be 'I′=(ℓ,G′,H,⟨≺H,σH⟩)'.
  3. [Section 5, Lemma 16] In the proof of Lemma 16, the sentence 'we conclude that ⟨≺H,σH⟩ is a solution of I' should refer to ⟨≺G,σG⟩, since the solution is the layout of G being constructed.
  4. [Section 5, Lemma 16] The sentence 'we replace for every two vertices u,v∈Eadd' should read 'for every two vertices u,v∈Vadd', since Eadd is a set of edges, not vertices.
  5. [Section 5, Theorem 5] The phrase 'O(nadd!·madd^{nadd}) potential orders among endpoints of new edges' is imprecise when nadd is larger than the number of vertices that are actually endpoints of new edges; the branching is over permutations of the new vertices, so the wording 'orders of the new vertices' would be clearer.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: QLE results are proven against external benchmarks; self-citations to the stack-layout paper are not load-bearing.

full rationale

The paper's central derivation chain is self-contained. Lemmas 7 and 8 prove the queue-layout/permutation-graph equivalence from scratch rather than importing it, and Theorems 1, 4, 5, and 6 are justified by reductions to or algorithms for external problems (precoloring extension [25], list-coloring [21], Multicolored Clique [11], and 2-SAT [2]) with full proofs included. Self-citations to the authors' stack-layout extension paper [12] provide proof strategies and comparative statements, but the proofs are not replaced by those citations: Theorem 2 gives Lemma 9 and the full FPT argument, Theorem 3 gives the branching argument, and Theorem 4 explicitly says the stack gadgets 'seem impossible to directly translate' and constructs new gadgets. No theorem assumes the target result, and no fitted parameter is renamed as a prediction. One non-circular correctness gap should be flagged: Section 5, Lemma 16 claims that subformula φ_1 'ensures antisymmetry, exactly one of these cases is true' and that every triple has at least two of its orders fixed by ≺_H or ≺_{Eadd}; φ_1 only forbids x_{u,v} and x_{v,u} both being true, and new vertices that are not endpoints of any new edge are not ordered by ≺_{Eadd}. This threatens the correctness proof of Theorem 5, but it is a proof gap, not a circular derivation.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The complexity results rest on standard parameterized complexity notions and on known results in permutation graph coloring and multicolored clique; no numerical parameters are fitted to data. The gadgets are proof constructs, not postulated physical entities.

assumptions (6)
  • standard math Standard graph theory and parameterized complexity definitions
    Used throughout the paper, e.g., FPT, W[1], XP, reductions; see Preliminaries and [11,14].
  • domain assumption Precoloring extension of permutation graphs is NP-complete
    Cited as [25] and used in Theorem 1 to establish NP-completeness of QLE with fixed vertex set.
  • domain assumption List coloring of permutation graphs with up to k colors is in XP parameterized by k
    Cited as [21] and used in Theorem 1 to prove membership in XP parameterized by the number of pages.
  • standard math Multicolored Clique is W[1]-hard parameterized by the number of color classes
    Cited as [11] and used as the source problem in the reduction proving Theorem 4.
  • standard math 2-SAT can be solved in linear time
    Cited as [2] and used in Lemma 16 to verify candidate layouts.
  • standard math Fixed-spine queue layouts correspond to colorings of a permutation graph
    Proved independently in Lemmas 7-8, originally attributed to Dushnik-Miller [18] and Dujmović-Wood [17]; used throughout Section 3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Peculiarities of Extending Queue Layouts." pith.science (2026). https://pith.science/paper/WESM7FIP

@misc{pith2026250605156,
  author       = {Pith},
  title        = {Pith review of: The Peculiarities of Extending Queue Layouts},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WESM7FIP}},
  note         = {Machine review of arXiv:2506.05156}
}
abstract

We consider the problem of computing $\ell$-page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to $\ell$ that avoid the nesting of edges on any of the pages. Inspired by previous work in the extension of stack layouts, here we consider the setting of extending a partial $\ell$-page queue layout into a complete one and primarily analyze the problem through the refined lens of parameterized complexity. We obtain novel algorithms and lower bounds which provide a detailed picture of the problem's complexity under various measures of incompleteness, and identify surprising distinctions between queue and stack layouts in the extension setting.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

27 extracted references · 10 canonical work pages

  1. [1]

    T esting P lanarity of P artially E mbedded G raphs

    Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, V \' t Jel \' nek, Jan Kratochv \' l, Maurizio Patrignani, and Ignaz Rutter. T esting P lanarity of P artially E mbedded G raphs. ACM Transactions on Algorithms , 11(4):32:1--32:42, 2015. https://doi.org/10.1145/2629341 doi:10.1145/2629341

    doi:10.1145/2629341 2015

  2. [2]

    Plass, and Robert Endre Tarjan

    Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A L inear- T ime A lgorithm for T esting the T ruth of C ertain Q uantified B oolean F ormulas. Information Processing Letters , 8(3):121--123, 1979. https://doi.org/10.1016/0020-0190(79)90002-4 doi:10.1016/0020-0190(79)90002-4

    doi:10.1016/0020-0190(79)90002-4 1979

  3. [3]

    Bekos, Henry F \" o rster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N

    Michael A. Bekos, Henry F \" o rster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, and Torsten Ueckerdt. P lanar G raphs of B ounded D egree H ave B ounded Q ueue N umber. SIAM Journal on Computing , 48(5):1487--1502, 2019. https://doi.org/10.1137/19M125340X doi:10.1137/19M125340X

    doi:10.1137/19m125340x 2019

  4. [4]

    O n the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults

    Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, and Martin Nöllenburg. O n the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults. In Helen C. Purchase and Ignaz Rutter, editors, Proc. 29th International Symposium on Graph Drawing and Network Visualization (GD'21) , volume 12868 of Lecture Notes in Computer Science , pages 2...

    work page doi:10.1007/978-3-030-92931-2_18 2021

  5. [5]

    On the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults

    Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, and Martin Nöllenburg. On the U pward B ook T hickness P roblem: C ombinatorial and C omplexity R esults. European Journal of Combinatorics , 110:103662, 2023. https://doi.org/10.1016/j.ejc.2022.103662 doi:10.1016/j.ejc.2022.103662

    arXiv 2023

  6. [6]

    Extending O rthogonal P lanar G raph D rawings I s F ixed- P arameter T ractable

    Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, and Martin N \" o llenburg. Extending O rthogonal P lanar G raph D rawings I s F ixed- P arameter T ractable. In Erin W. Chambers and Joachim Gudmundsson, editors, Proc. 39th International Symposium on Computational Geometry (SoCG'23) , volume 258 of LIPIcs , pages 18:1--18:16. Schloss Da...

    doi:10.4230/lipics.socg.2023.18 2023

  7. [7]

    P arameterized A lgorithms for Q ueue L ayouts

    Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, and Martin N \" o llenburg. P arameterized A lgorithms for Q ueue L ayouts. Journal of Graph Algorithms and Applications , 26(3):335--352, 2022. https://doi.org/10.7155/JGAA.00597 doi:10.7155/JGAA.00597

    doi:10.7155/jgaa.00597 2022

  8. [8]

    P arameterized A lgorithms for Q ueue L ayouts

    Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, and Martin Nöllenburg. P arameterized A lgorithms for Q ueue L ayouts. In David Auber and Pavel Valtr, editors, Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD'20) , volume 12590 of Lecture Notes in Computer Science , pages 40--54. Springer, 2020. https://doi.org/10.1007/...

    work page doi:10.1007/978-3-030-68766-3_4 2020

Show all 27 references
  1. [9]

    Embedding graphs in books: a survey

    Tomasz Bilski. Embedding graphs in books: a survey. IEE Proceedings E (Computers and Digital Techniques) , 139(2):134, 1992. https://doi.org/10.1049/ip-e.1992.0021 doi:10.1049/ip-e.1992.0021

    1992

  2. [10]

    Fan R. K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg. E mbedding G raphs in B ooks: A L ayout P roblem with A pplications to VLSI D esign. SIAM Journal on Algebraic Discrete Methods , 8(1):33--58, 1987. https://doi.org/10.1137/0608002 doi:10.1137/0608002

    1987 doi

  3. [11]

    Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh

    Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized A lgorithms . Springer, 2015. https://doi.org/10.1007/978-3-319-21275-3 doi:10.1007/978-3-319-21275-3

    2015 doi

  4. [12]

    Fink, Robert Ganian, and Martin N \"o llenburg

    Thomas Depian, Simon D. Fink, Robert Ganian, and Martin N \"o llenburg. T he P arameterized C omplexity O f E xtending S tack L ayouts. In Stefan Felsner and Karsten Klein, editors, Proc. 32nd International Symposium on Graph Drawing and Network Visualization (GD'24) , volume ...

    2024 doi

  5. [13]

    P athways to T ractability for G eometric T hickness

    Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, and Martin Nöllenburg. P athways to T ractability for G eometric T hickness. In Rastislav Kralovic and Věra Kůrková, editors, Proc. 50th Conference on Current Trends in Theory and Practice of Computer Science ...

    2025 doi

  6. [14]

    G raph T heory, 4th E dition , volume 173 of Graduate T exts in M athematics

    Reinhard Diestel. G raph T heory, 4th E dition , volume 173 of Graduate T exts in M athematics . Springer, 2012

    2012

  7. [15]

    Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, and David R. Wood. S tack- N umber is N ot B ounded by Q ueue- N umber. Combinatorica , 42(2):151--164, 2022. https://doi.org/10.1007/S00493-021-4585-7 doi:10.1007/S00493-021-4585-7

    2022 doi

  8. [16]

    Vida Dujmovic, Gwena \" e l Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar G raphs H ave B ounded Q ueue- N umber. Journal of the ACM , 67(4):22:1--22:38, 2020. https://doi.org/10.1145/3385731 doi:10.1145/3385731

    2020 doi

  9. [17]

    Vida Dujmović and David R. Wood. O n L inear L ayouts of G raphs. Discrete Mathematics & Theoretical Computer Science , Vol. 6 no. 2, 2004. https://doi.org/10.46298/dmtcs.317 doi:10.46298/dmtcs.317

    2004 doi

  10. [18]

    Ben Dushnik and E. W. Miller. P artially O rdered S ets. American Journal of Mathematics , 63(3):600, 1941. https://doi.org/10.2307/2371374 doi:10.2307/2371374

    1941 doi

  11. [19]

    E xtending P artial 1 - P lanar D rawings

    Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin N \" o llenburg. E xtending P artial 1 - P lanar D rawings. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, Proc. 47th International Colloquium on Automata, Languages and Programming (ICALP'20) , vo...

    2020 doi

  12. [20]

    E xtending N early C omplete 1- P lanar D rawings in P olynomial T ime

    Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg. E xtending N early C omplete 1- P lanar D rawings in P olynomial T ime. In Javier Esparza and Daniel Kr \' a l', editors, Proc. 45th Mathematical Foundations of Computer Science (MFCS'20) , volume 1...

    2020 doi

  13. [21]

    On L ist C oloring and L ist H omomorphism of P ermutation and I nterval G raphs

    Jessica Enright, Lorna Stewart, and Gábor Tardos. On L ist C oloring and L ist H omomorphism of P ermutation and I nterval G raphs. SIAM Journal on Discrete Mathematics , 28(4):1675--1685, 2014. https://doi.org/10.1137/13090465x doi:10.1137/13090465x

    2014 doi

  14. [22]

    C rossing- O ptimal E xtension of S imple D rawings

    Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, and Birgit Vogtenhuber. C rossing- O ptimal E xtension of S imple D rawings. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, Proc. 48th International Colloquium on Automata, Languages and Programming (ICAL...

    2021 doi

  15. [23]

    Algorithmic G raph T heory and P erfect G raphs

    Martin Charles Golumbic. Algorithmic G raph T heory and P erfect G raphs . Elsevier, 1980. https://doi.org/10.1016/c2013-0-10739-8 doi:10.1016/c2013-0-10739-8

    1980 doi

  16. [24]

    Heath and Arnold L

    Lenwood S. Heath and Arnold L. Rosenberg. L aying O ut G raphs U sing Q ueues. SIAM Journal on Computing , 21(5):927--958, 1992. https://doi.org/10.1137/0221055 doi:10.1137/0221055

    1992 doi

  17. [25]

    The O ptimum C ost C hromatic P artition P roblem

    Klaus Jansen. The O ptimum C ost C hromatic P artition P roblem. In Gian Carlo Bongiovanni, Daniel P. Bovet, and Giuseppe Di Battista, editors, Proc. 3rd International Conference on Algorithms and Complexity (CIAC'97) , volume 1203 of Lecture Notes in Computer Science , pages ...

    1997 doi

  18. [26]

    On the k- C olouring of C ircle- G raphs

    Walter Unger. On the k- C olouring of C ircle- G raphs. In Robert Cori and Martin Wirsing, editors, Proc. 5th Symposium on Theoretical Aspects of Computer Science (STACS'88) , volume 294 of Lecture Notes in Computer Science , pages 61--72. Springer, 1988. https://doi.org/10.10...

    1988 doi

  19. [27]

    On the Q ueue- N umber of G raphs with B ounded T ree- W idth

    Veit Wiechert. On the Q ueue- N umber of G raphs with B ounded T ree- W idth. The Electronic Journal of Combinatorics , 24(1):1, 2017. https://doi.org/10.37236/6429 doi:10.37236/6429

    2017 doi

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.