The following pages link to (Q3819088):
Displaying 9 items.
- Dicycle cover of Hamiltonian oriented graphs (Q275871) (← links)
- A note about a theorem by Maamoun on decompositions of digraphs into elementary directed paths or cycles (Q1066157) (← links)
- Circuit decompositions of Eulerian graphs (Q1569071) (← links)
- Packing circuits in eulerian digraphs (Q1924492) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- A cycle decomposition conjecture for Eulerian graphs (Q2875480) (← links)
- What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? (Q3745872) (← links)
- A note on mixed graphs and directed splitting off (Q4242949) (← links)
- On even circuit decompositions of eulerian graphs (Q4277987) (← links)