The dual graph of a Polyhedral Graph has Vertices each of which corresponds to a face of and each of whose faces corresponds to a Vertex of . Two nodes in are connected by an Edge if the corresponding faces in have a boundary Edge in common.

© 1996-9

1999-05-24