Characterization of \((m, n)\)-linked planar graphs (Q2160994)
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: Characterization of (m, n)-linked planar graphs |
scientific article; zbMATH DE number 7567453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of \((m, n)\)-linked planar graphs |
scientific article; zbMATH DE number 7567453 |
Statements
Characterization of \((m, n)\)-linked planar graphs (English)
0 references
3 August 2022
0 references
triangulation
0 references
maximal planar graph
0 references
planar graph
0 references
0.9090682864189148
0 references
0.7690496444702148
0 references
0.7684311270713806
0 references
0.7684311270713806
0 references
