Counting Embeddings of Planar Graphs Using DFS Trees

DOI10.1137/0406027zbMath0778.68070OpenAlexW1993974115MaRDI QIDQ3136607

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

embeddingplanar graphdepth-first searchconnected componentarticulation point

Mathematics Subject Classification ID

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

Related Items (1)

On fully diverse sets of geometric objects and graphs

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