ContactPerson: huazhang@cse.buffalo.edu
Remote host: pollux.cse.buffalo.edu
### Begin Citation ### Do not delete this line ###
%R 2005-14
%U /home/mthgrad/huazhang/vr.ps
%A Huaming Zhang
%A Xin He
%T An Application of Well-Orderly Trees in Graph Drawing
%D May 30, 2005
%I Department of Computer Science and Engineering, SUNY Buffalo
%X Well-orderly trees seem to have the potential of becoming a
powerful technique capable of deriving new results in graph encoding,
graph enumeration and graph generation \cite{BGH03,BGH0302}. Our
application of well-orderly trees in this paper provides new evidence
to their power. We give more compact visibility representation of plane graphs using the properties of well orderly trees.