A Study on Strict d-box Representations of Planar Graphs
碩士 === 國立政治大學 === 應用數學研究所 === 101 === We study strict d-box representations of planar graphs. We prove that a 4-connected planar triangulation graph G has a strict 2-box representation. We extend this result to that every planar graph has a strict 3-box representation. Our goal is to provide some fr...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/45133629952335517723 |