On non-intersecting Eulerian circuits
From MaRDI portal
Publication:1090338
DOI10.1016/0166-218X(87)90045-XzbMath0621.05022MaRDI QIDQ1090338
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Unnamed Item, Bounding the number of Eulerian tours in undirected graphs, Refined bounds on the number of Eulerian tours in undirected graphs, Drawing the planar dual, Dominating sets whose closed stars form spanning trees, The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs, DNA origami and the complexity of Eulerian circuits with turning costs, The complexity of counting Eulerian tours in 4-regular graphs, Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
Cites Work