Checking the admissibility of odd-vertex pairings is hard (Q2142685): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:29, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking the admissibility of odd-vertex pairings is hard |
scientific article |
Statements
Checking the admissibility of odd-vertex pairings is hard (English)
0 references
27 May 2022
0 references
orientation
0 references
connectivity
0 references
