Pages that link to "Item:Q5397736"
From MaRDI portal
The following pages link to Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs (Q5397736):
Displayed 7 items.
- Exact localisations of feedback sets (Q722200) (← links)
- Decomposing tournaments into paths (Q1690018) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- Note on long paths in Eulerian digraphs (Q2034059) (← links)
- Minimum arc-cuts of normally regular digraphs and Deza digraphs (Q2138973) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Minimum cuts of distance-regular digraphs (Q2409834) (← links)
