scientific article; zbMATH DE number 1792067

MaRDI QIDQ4552008zbMATH OpenFDO

Authors Osamu Nakamura

Publication date 24 February 2003

zbMATH Keywords

algorithmembeddingenumeration

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On counting planar embeddings
• Ranking and unranking planar embeddings
• scientific article; zbMATH DE number 1792068
• Boolean approach to planar embeddings of a graph
• Listing All Plane Graphs

Cited in

(8)

• On counting planar embeddings
• On spatial graphs isotopic to planar embeddings
• Counting Embeddings of Planar Graphs Using DFS Trees
• Connected Plane Sets which Contain no Nondegenerate Connected Simple Graph
• Ranking and unranking planar embeddings
• The number of polyhedral (3-connected planar) graphs
• scientific article; zbMATH DE number 6146491 (Why is no real title available?)
• Linear time canonicalization and enumeration of non-isomorphic 1-face embeddings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4552008)