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
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20178 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4241287491 / rank | |||
Normal rank | |||
Latest revision as of 15:23, 19 March 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
