A two-connected planar graph without concurrent longest paths (Q2554342)
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: A two-connected planar graph without concurrent longest paths |
scientific article; zbMATH DE number 3384051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-connected planar graph without concurrent longest paths |
scientific article; zbMATH DE number 3384051 |
Statements
A two-connected planar graph without concurrent longest paths (English)
0 references
1972
0 references
0 references
