Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time” (Q4117837)
From MaRDI portal
scientific article; zbMATH DE number 3542435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time” |
scientific article; zbMATH DE number 3542435 |
Statements
Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time” (English)
0 references
1977
0 references
