Finding large matchings in 1-planar graphs of minimum degree 3 (Q2110625)
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: Finding large matchings in 1-planar graphs of minimum degree 3 |
scientific article; zbMATH DE number 7636210
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding large matchings in 1-planar graphs of minimum degree 3 |
scientific article; zbMATH DE number 7636210 |
Statements
Finding large matchings in 1-planar graphs of minimum degree 3 (English)
0 references
21 December 2022
0 references
