On non-intersecting Eulerian circuits

DOI10.1016/0166-218X(87)90045-XzbMath0621.05022MaRDI QIDQ1090338

Samuel W. Bent, Udi Manber

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Eulerian circuitflame-cutting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45)

Related Items

The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs ⋮ Dominating sets whose closed stars form spanning trees ⋮ Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes ⋮ Bounding the number of Eulerian tours in undirected graphs ⋮ The complexity of counting Eulerian tours in 4-regular graphs ⋮ Refined bounds on the number of Eulerian tours in undirected graphs ⋮ Unnamed Item ⋮ Drawing the planar dual ⋮ DNA origami and the complexity of Eulerian circuits with turning costs

Cites Work

• Planar Formulae and Their Uses
• Unnamed Item
• Unnamed Item