The following pages link to Cycles in digraphs– a survey (Q3907591):
Displaying 50 items.
- A degree condition for cycles of maximum length in bipartite digraphs (Q409445) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Vertex-disjoint cycles in regular tournaments (Q427838) (← links)
- Euler index in uncertain graph (Q449488) (← links)
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li (Q516779) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem (Q602719) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Cycle-pancyclism in tournaments. III (Q675888) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree (Q708429) (← links)
- On \(d\)-arc-dominated oriented graphs (Q742615) (← 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)
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
- The Hoàng-Reed conjecture for \(\delta ^{+}=3\) (Q973119) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← 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)
- An improved bound for disjoint directed cycles (Q1637139) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture (Q1689895) (← links)
- Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
- Vertex disjoint 4-cycles in bipartite tournaments (Q1699558) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- On the number of disjoint 4-cycles in regular tournaments (Q1708396) (← links)
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs (Q1785251) (← links)
