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. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n — 1)/5, by using well-orderly trees.
展开▼
