Counting Embeddings of Planar Graphs Using DFS Trees

DOI10.1137/0406027zbMATH Open0778.68070OpenAlexW1993974115MaRDI QIDQ3136607FDOQ3136607

Jiazhen Cai

Publication date: 14 October 1993

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

Full work available at URL: https://semanticscholar.org/paper/b900035a00e3257f532b3e9c9fdc6168874e008b

zbMATH Keywords

embeddingdepth-first searchconnected componentplanar grapharticulation point

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited In (3)

• On counting planar embeddings
• On fully diverse sets of geometric objects and graphs
• Title not available (Why is that?)

   Recommendations

• On counting planar embeddings 👍 👎
• Title not available (Why is that?) 👍 👎
• Ranking and unranking planar embeddings 👍 👎
• A linear algorithm for embedding planar graphs using PQ-trees 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Counting Embeddings of Planar Graphs Using DFS Trees

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