Algorithms for finding an induced cycle in planar graphs and bounded genus graphs (Q4633929)
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: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs |
scientific article; zbMATH DE number 7051285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding an induced cycle in planar graphs and bounded genus graphs |
scientific article; zbMATH DE number 7051285 |
Statements
6 May 2019
0 references
0.9101529121398926
0 references
0.8287211656570435
0 references
0.8279460668563843
0 references
0.8253254890441895
0 references
