On non-intersecting Eulerian circuits
From MaRDI portal
Recommendations
- On circuit decomposition of planar Eulerian graphs
- Covering and Euler cycles on non-oriented graphs
- On even circuit decompositions of eulerian graphs
- Circuit decompositions of Eulerian graphs
- scientific article; zbMATH DE number 3946164
- scientific article; zbMATH DE number 63789
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
- Publication:4207932
- On circuits in graphs
Cites work
Cited in
(15)- Dominating sets whose closed stars form spanning trees
- DNA origami and the complexity of Eulerian circuits with turning costs
- scientific article; zbMATH DE number 4128845 (Why is no real title available?)
- Bounding the number of Eulerian tours in undirected graphs
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
- Refined bounds on the number of Eulerian tours in undirected graphs
- Removing popular faces in curve arrangements
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
- Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
- Drawing the planar dual
- Removing popular faces in curve arrangements
- Complexity of circuit intersection in graphs
- NP-completeness of the Eulerian walk problem for a multiple graph
- The topology of scaffold routings on non-spherical mesh wireframes
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
This page was built for publication: On non-intersecting Eulerian circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090338)
