A two-connected planar graph without concurrent longest paths (Q2554342): Difference between revisions
From MaRDI portal
Latest revision as of 11:33, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A two-connected planar graph without concurrent longest paths |
scientific article |
Statements
A two-connected planar graph without concurrent longest paths (English)
0 references
1972
0 references
0 references