A note on planar partial 3-trees
From MaRDI portal
Publication:6236798
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.
This page was built for publication: A note on planar partial 3-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6236798)
