Pages that link to "Item:Q1893154"
From MaRDI portal
The following pages link to The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154):
Displayed 10 items.
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Series parallel extensions of plane graphs to dual-Eulerian graphs (Q864153) (← links)
- Dominating sets whose closed stars form spanning trees (Q1357724) (← links)
- Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs (Q1392551) (← 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)
- (Q5080901) (← links)
- On Finding Hamiltonian Cycles in Barnette Graphs (Q5880941) (← links)
- Design methods for 3D wireframe DNA nanostructures (Q6084211) (← links)
- Generating functions and counting formulas for spanning trees and forests in hypergraphs (Q6153615) (← links)