Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree (Q3000509)
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 graph or a tree |
scientific article; zbMATH DE number 5897214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree |
scientific article; zbMATH DE number 5897214 |
Statements
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (English)
0 references
19 May 2011
0 references
0 references
0 references
0 references
0.982844889163971
0 references
0.8955824375152588
0 references
0.8653477430343628
0 references
0.8629802465438843
0 references
