The following pages link to (Q3672016):
Displayed 12 items.
- Circuit extension and circuit double cover of graphs (Q390272) (← links)
- Compatible Euler tours for transition systems in Eulerian graphs (Q580368) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- Bidirectional retracting-free double tracings and upper embeddability of graphs (Q751672) (← links)
- An algorithm for an Eulerian trail traversing specified edges in given order (Q1343142) (← links)
- Circuit decompositions of Eulerian graphs (Q1569071) (← links)
- Splitting in a binary matroid (Q1584222) (← links)
- A note on immersion minors and planarity (Q1744743) (← links)
- Some results involving the splitting operation on binary matroids (Q1935980) (← links)
- Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor (Q2312600) (← links)
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes (Q2399751) (← links)
- Odd Decompositions of Eulerian Graphs (Q5357956) (← links)