scientific article; zbMATH DE number 1792067

zbMATH Open1006.05020MaRDI QIDQ4552008FDOQ4552008

Authors: Osamu Nakamura 

Publication date: 24 February 2003

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

algorithmembeddingenumeration

Mathematics Subject Classification ID

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

Cited In (7)

• On spatial graphs isotopic to planar embeddings
• Linear time canonicalization and enumeration of non-isomorphic 1-face embeddings
• Counting Embeddings of Planar Graphs Using DFS Trees
• On counting planar embeddings
• Title not available (Why is that?)
• Connected Plane Sets which Contain no Nondegenerate Connected Simple Graph
• Ranking and unranking planar 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)