A concrete tripod-decomposition counterexample shows that Claim 2 in the 42-queue layout paper of Bekos, Gronemann, and Raftopoulou is false, so the 42 bound is not proved.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Gap in the 42-Queue Layout Algorithm for Planar Graphs
A concrete tripod-decomposition counterexample shows that Claim 2 in the 42-queue layout paper of Bekos, Gronemann, and Raftopoulou is false, so the 42 bound is not proved.