Pages that link to "Item:Q1924492"
From MaRDI portal
The following pages link to Packing circuits in eulerian digraphs (Q1924492):
Displaying 14 items.
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Euler Digraphs (Q3120436) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- (Q5111250) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
