On representations of some thickness-two graphs

Joan P. Hutchinson, Thomas Shermer, Andrew Vince
<span title="">1999</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
This paper considers representations of graphs as rectangle-visibility graphs and as doubly linear graphs. These are, respectively, graphs whose vertices are isothetic rectangles in the plane with adjacency determined by horizontal and vertical visibility, and graphs that can be drawn as the union of two straight-edged planar graphs. We prove that these graphs have, with n vertices, at most 6n − 20 (respectively, 6n − 18) edges, and we provide examples of these graphs with 6n − 20 edges for each n 8.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(99)00018-8">doi:10.1016/s0925-7721(99)00018-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5bcoo7cxgrcdxg2vnwffkx5rwi">fatcat:5bcoo7cxgrcdxg2vnwffkx5rwi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130108000435/http://www.math.ufl.edu/~avince/Papers/Thickness2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fa/98/fa9885ab6a12307c100d20039557ca5e61a42d46.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(99)00018-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>