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
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5121310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation |
scientific article; zbMATH DE number 5121310 |
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
0.8501807451248169
0 references
0.8437904119491577
0 references
0.817050039768219
0 references
0.8116019368171692
0 references
