Pages that link to "Item:Q1090338"
From MaRDI portal
The following pages link to On non-intersecting Eulerian circuits (Q1090338):
Displayed 9 items.
- Drawing the planar dual (Q1198002) (← links)
- Dominating sets whose closed stars form spanning trees (Q1357724) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- DNA origami and the complexity of Eulerian circuits with turning costs (Q2003481) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes (Q2660538) (← links)
- (Q6079208) (← links)
- Bounding the number of Eulerian tours in undirected graphs (Q6113863) (← links)
- Refined bounds on the number of Eulerian tours in undirected graphs (Q6185942) (← links)