Ranking and unranking planar embeddings

DOI10.1080/03081088508817673zbMath0597.05028OpenAlexW2062943289MaRDI QIDQ3728923

Wayne E. Dick, Kiem-Phong Vo, S. Gill Williamson

Publication date: 1985

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088508817673

zbMATH Keywords

rankingplanar graphplanar embeddingsplanar biconnected graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

Bijective comparison of optimal planarity algorithms ⋮ Canonical forms for cycles in bridge graphs ⋮ Menus of kuratowski subgraphs ⋮ The two basic linear time Planarity algorithms: Are they the same?

Cites Work

• Unnamed Item
• Unnamed Item
• A structural characterization of planar combinatorial graphs
• Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs
• Determining outerplanarity using segment graphs
• Finding triconnected components of graphs
• Embedding Graphs in the Plane—Algorithmic Aspects
• Efficient Planarity Testing

This page was built for publication: Ranking and unranking planar embeddings