On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation (Q3418193): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 19:15, 4 February 2024
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