File:Nested triangle graph grid.svg
Summary
| Description |
English: Grid drawing of a A nested triangles graph with 18 vertices. This layout may be used to draw any such graph within a bounding box of dimensions (n/3 + O(1)) × (n/2 + O(1)). This doesn't improve a bound of n/3 × 2n/3 of Frati & Patrignani (2008), because their bound applies more generally to maximal graphs formed by adding diagonals to the quadrilaterals of this graph, and not every maximal graph can be drawn in this way. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
