Recognizing hyperelliptic graphs in polynomial time (Q5915587)
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: Recognizing hyperelliptic graphs in polynomial time |
scientific article; zbMATH DE number 6982995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing hyperelliptic graphs in polynomial time |
scientific article; zbMATH DE number 6982995 |
Statements
Recognizing hyperelliptic graphs in polynomial time (English)
0 references
22 November 2018
0 references
0.9893585443496704
0 references
0.735396683216095
0 references
0.7351188063621521
0 references
0.7221301198005676
0 references
0.7198256254196167
0 references
