The following pages link to Euler tours in hypergraphs (Q2658380):
Displaying 16 items.
- Multi-Eulerian tours of directed graphs (Q281626) (← links)
- Perfect set of Euler tours of \(K_{p,p,p}\) (Q339456) (← links)
- The number of Euler tours of random directed graphs (Q396813) (← links)
- On tours that contain all edges of a hypergraph (Q612925) (← links)
- Compatible Euler tours and supplementary Eulerian vectors (Q1321675) (← links)
- Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts (Q1660265) (← links)
- Graph universal cycles of combinatorial objects (Q2020052) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- The number of Euler tours of a random directed graph (Q2959900) (← links)
- (Q3972098) (← links)
- A Construction of a perfect set of Euler tours of K2k+1 (Q4222151) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Covering hypergraphs are Eulerian (Q6081586) (← links)
- Using edge cuts to find Euler tours and Euler families in hypergraphs (Q6172287) (← links)
- Cycle decompositions in \(k\)-uniform hypergraphs (Q6500099) (← links)
- Euler's theorem for regular CW-complexes (Q6548024) (← links)