Note
On non-intersecting Eulerian circuits☆

https://doi.org/10.1016/0166-218X(87)90045-XGet rights and content
Under an Elsevier user license
open archive

Abstract

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.

Cited by (0)

☆

This research was supported in part by the National Science Foundation under Grants MCS-8203238 and MCS-8303134.

Copyright © 1987 Published by Elsevier B.V.