REVIEW 2 cited by
A note on planar partial 3-trees
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to prove a couple of results for planar partial 3-trees by induction on the structure of the underlying planar 3-tree completion. We provide an explicit proof of this observation and strengthen it by showing that one can keep the plane drawing of the input graph unchanged.
Forward citations
Cited by 2 Pith papers
-
Short Paths in the Planar Graph Product Structure Theorem
Every n-vertex planar graph is contained in H ⊠ P ⊠ K_c for some planar H of treewidth 3 and a path P of length O((tw(G)+1)^(1-ε) n^ε).
-
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.
Discussion (0). Continue with ORCID to comment.