On counting planar embeddings

DOI10.1016/0012-365X(93)90316-LzbMath0795.05075MaRDI QIDQ1313885

Matthias F. M. Stallmann

Publication date: 10 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

embeddingscountingplanar graphembedding tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

On fully diverse sets of geometric objects and graphs ⋮ Lower bounds for electrical reduction on surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for embedding planar graphs using PQ-trees
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A structural characterization of planar combinatorial graphs
• Efficient Planarity Testing

This page was built for publication: On counting planar embeddings