The following pages link to Cycles in digraphs– a survey (Q3907591):
Displayed 39 items.
- Disjoint cycles in digraphs (Q595675) (← links)
- Cycle-pancyclism in tournaments. III (Q675888) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Signsolvability revisited (Q795898) (← links)
- Number of arcs and cycles in digraphs (Q799688) (← links)
- On hamiltonian line graphs and connectivity (Q803154) (← links)
- Almost symmetric cycles in large digraphs (Q882781) (← links)
- Cycles and paths of many lengths in bipartite digraphs (Q923098) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- About some cyclic properties in digraphs (Q1058520) (← links)
- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) (Q1066160) (← links)
- Sign-nonsingular matrices and even cycles in directed graphs (Q1073811) (← links)
- A sufficient condition for oriented graphs to be Hamiltonian (Q1079579) (← links)
- Even cycles in directed graphs (Q1084409) (← links)
- Characterization of even directed graphs (Q1085177) (← links)
- Counterexamples to Adám's conjecture on arc reversals in directed graphs (Q1086583) (← links)
- On digraphs with no two disjoint directed cycles (Q1092919) (← links)
- Cycles of length 0 modulo k in directed graphs (Q1093650) (← links)
- Bounds of the longest directed cycle length for minimal strong digraphs (Q1106239) (← links)
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs (Q1117243) (← links)
- Cycles in strong oriented graphs (Q1158163) (← links)
- Longest paths in digraphs (Q1165864) (← links)
- Degrees and cycles in digraphs (Q1165865) (← links)
- Highly connected non-2-linked digraphs (Q1181017) (← links)
- Kings in \(k\)-partite tournaments (Q1185101) (← links)
- Hamiltonian paths and cycles, number of arcs and independence number in digraphs (Q1199482) (← links)
- Orientations of Hamiltonian cycles in bipartite digraphs (Q1337013) (← links)
- An upper bound for the Hamiltonicity exponent of finite digraphs (Q1356721) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- \(G\)-designs and related designs (Q1802138) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- Cycle-pancyclism in tournaments. I (Q1900518) (← links)
- Cycle packings in graphs and digraphs (Q1910593) (← links)
- Cycle-pancyclism in tournaments. II (Q1911236) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Cycles in a tournament with pairwise zero, one or two given vertices in common (Q2470442) (← links)
- Long cycles in graphs and digraphs (Q3439406) (← links)
- Two proofs of Bermond-Thomassen conjecture for regular tournaments (Q3439564) (← links)
- All Circuits Enumeration in Macro-Econometric Models (Q5302460) (← links)