Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560)
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: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph |
scientific article; zbMATH DE number 6082051
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph |
scientific article; zbMATH DE number 6082051 |
Statements
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (English)
0 references
13 September 2012
0 references
simultaneous embedding with fixed edges
0 references
planarity
0 references
linear-time algorithm
0 references
SPQR-tree
0 references
0 references
0 references
