Name
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. |
Year | Venue | Field |
|---|---|---|
2012 | arXiv: Discrete Mathematics | Discrete mathematics,Graph,Combinatorics,Planar straight-line graph,Planar,Mathematics,Planar graph |
DocType | Volume | Citations |
Journal | abs/1210.8113 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Kratochvíl | 1 | 1751 | 151.84 |
| Michal Vaner | 2 | 0 | 0.34 |