On non-intersecting Eulerian circuits (Q1090338)
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 4006297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On non-intersecting Eulerian circuits |
scientific article; zbMATH DE number 4006297 |
Statements
On non-intersecting Eulerian circuits (English)
0 references
1987
0 references
The following question arises in flame-cutting and similar applications. ''Given a graph drawn in the plane, is there an Eulerian circuit in which successive edges always belong to a common face?'' We prove that this question and related ones are NP-complete.
0 references
flame-cutting
0 references
Eulerian circuit
0 references
0.87667674
0 references
0.8747874
0 references
0.8739146
0 references
0.8724195
0 references
0.85770434
0 references
