Bounding the number of odd paths in planar graphs via convex optimization (Q6406864)
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: Bounding the number of odd paths in planar graphs via convex optimization |
scientific article; zbMATH DE number 900569837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the number of odd paths in planar graphs via convex optimization |
scientific article; zbMATH DE number 900569837 |
Statements
3 August 2022
0 references
