Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 (Q3474885)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 |
scientific article; zbMATH DE number 4143435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 |
scientific article; zbMATH DE number 4143435 |
Statements
Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 (English)
0 references
1990
0 references
shortest circuit covers
0 references
Chinese postman problem
0 references
0.8668810725212097
0 references
0.8464818596839905
0 references
0.8395889401435852
0 references
0.8373920917510986
0 references
0.8351648449897766
0 references
