A Note on alpha-Drawable k-Trees

We study the problem of realizing a given graph as an -complex of a set of points in the plane. We study the realizability problem for trees and 2-trees. In the case of 2-trees, we confine our attention to the realizability of graphs as the -complex minus faces of dimension two; in other words, realizability of the graph in terms of the 1-skeleton of the -complex of the point set. We obtain both positive (realizability) and negative (non-realizability) results.

By: David Bremner; Jonathan Lenchner; Giuseppe Liotta; Christophe Paul; Marc Pouget; Svetlana Stolpner; Stephen Wismath

Published in: RC24605 in 2008


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .