Counting Embeddings of Planar Graphs Using DFS Trees (Q3136607)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting Embeddings of Planar Graphs Using DFS Trees |
scientific article; zbMATH DE number 425589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting Embeddings of Planar Graphs Using DFS Trees |
scientific article; zbMATH DE number 425589 |
Statements
Counting Embeddings of Planar Graphs Using DFS Trees (English)
0 references
14 October 1993
0 references
depth-first search
0 references
embedding
0 references
articulation point
0 references
connected component
0 references
planar graph
0 references
0.841647744178772
0 references
0.8088831901550293
0 references
0.8072059750556946
0 references
