On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation (Q3418193)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation |
scientific article |
Statements
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation (English)
0 references
2 February 2007
0 references
Max-cut problem cubic planar graphs Chinese postman problem
0 references
