Pages that link to "Item:Q1092919"
From MaRDI portal
The following pages link to On digraphs with no two disjoint directed cycles (Q1092919):
Displaying 21 items.
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- Robust economic models (Q673799) (← links)
- Disjoint directed and undirected paths and cycles in digraphs (Q1034635) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- Digraphs without directed path of length two or three (Q1068100) (← links)
- On cycles of directed graphs (Q1106238) (← links)
- Directed circuits on a torus (Q1180428) (← links)
- Detecting stable matrices (Q1380437) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- Nearly sign-nonsingular matrices (Q1893090) (← links)
- Directed cycles with two chords and strong spanning directed subgraphs with few arcs (Q1907108) (← links)
- On the problem of finding disjoint cycles and dicycles in a digraph (Q2428634) (← links)
- Arc-disjoint directed and undirected cycles in digraphs (Q2833257) (← links)
- Disjoint sub(di)graphs in digraphs (Q2851460) (← links)
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) (Q3642864) (← links)
- Characterizations of simply disconnected complete digraphs (Q3973036) (← links)
- Digraphs containing every possible pair of dicycles (Q4489490) (← links)
- On the Number of Vertex-Disjoint Cycles in Digraphs (Q5205389) (← links)
- Two disjoint cycles in digraphs (Q6081571) (← links)
