Cycles in digraphs– a survey

DOI10.1002/jgt.3190050102zbMath0458.05035OpenAlexW2157737769MaRDI QIDQ3907591

Carsten Thomassen, Jean-Claude Bermond

Publication date: 1981

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02424283/file/44-BeTh81-surveycyclesdigraphs.pdf

zbMATH Keywords

hamiltonian cycles covering and packing

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items

Edge-disjoint properly colored cycles in edge-colored complete graphs, Disjoint cycles in tournaments and bipartite tournaments, A sufficient condition for oriented graphs to be Hamiltonian, On disjoint cycles of the same length in tournaments, Even cycles in directed graphs, Characterization of even directed graphs, Orientations of Hamiltonian cycles in bipartite digraphs, Counterexamples to Adám's conjecture on arc reversals in directed graphs, Long cycles in subgraphs of (pseudo)random directed graphs, Vertex-disjoint rainbow cycles in edge-colored graphs, On digraphs with no two disjoint directed cycles, Cycles of length 0 modulo k in directed graphs, An improved bound for disjoint directed cycles, On $d$-panconnected tournaments with large semidegrees, The reversing number of a digraph, All Circuits Enumeration in Macro-Econometric Models, An upper bound for the Hamiltonicity exponent of finite digraphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, Cycle-pancyclism in tournaments. I, Bounds of the longest directed cycle length for minimal strong digraphs, A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture, Cycle packings in graphs and digraphs, Cycle-pancyclism in tournaments. II, Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs, Disjoint cycles in digraphs, Trail-connected tournaments, Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree, Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem, Almost symmetric cycles in large digraphs, On Dominating Even Subgraphs in Cubic Graphs, Disjoint cycles of different lengths in graphs and digraphs, Properly colored cycles of different lengths in edge-colored complete graphs, Lichiardopol's conjecture on disjoint cycles in tournaments, A causal filter of gradient information for enhanced robustness and resilience in distributed convex optimization, Complementary cycles of any length in regular bipartite tournaments, Two disjoint cycles in digraphs, Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture, Decomposing edge-colored graphs under color degree constraints, On sufficient conditions for rainbow cycles in edge-colored graphs, On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs, Vertex‐disjoint cycles of the same length in tournaments, A degree condition for cycles of maximum length in bipartite digraphs, A survey on Hamilton cycles in directed graphs, Turán problems for $k$-geodetic digraphs, Vertex disjoint 4-cycles in bipartite tournaments, On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs, Vertex-disjoint cycles in regular tournaments, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Cycles in strong oriented graphs, Partition and disjoint cycles in digraphs, On the number of disjoint 4-cycles in regular tournaments, Euler index in uncertain graph, Longest paths in digraphs, Degrees and cycles in digraphs, Cycles and paths of many lengths in bipartite digraphs, Vertex-disjoint cycles in bipartite tournaments, Disjoint cycles with different length in 4-arc-dominated digraphs, How many conjectures can you stand? A survey, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Sufficient conditions for Hamiltonian cycles in bipartite digraphs, Highly connected non-2-linked digraphs, Kings in $k$-partite tournaments, Multipartite tournaments: a survey, Cycle-pancyclism in tournaments. III, Cycles in a tournament with pairwise zero, one or two given vertices in common, On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li, Vertex-disjoint cycles in bipartite tournaments, Hamiltonian paths and cycles, number of arcs and independence number in digraphs, Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree, Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments, Euler index of uncertain random graph: concepts and properties, Ear decomposition for pair comparison data, On degree sum conditions for directed path-factors with a specified number of paths, Vertex-disjoint cycles in local tournaments, An improvement of Lichiardopol's theorem on disjoint cycles in tournaments, The Hoàng-Reed conjecture for $\delta ^{+}=3$, Hamiltonian degree sequences in digraphs, Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree, Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs, On the Number of Vertex-Disjoint Cycles in Digraphs, $G$-designs and related designs, On $d$-arc-dominated oriented graphs, Properly colored short cycles in edge-colored graphs, Subdivisions in digraphs of large out-degree or large dichromatic number, Spanning acyclic subdigraphs and strong $t$-panconnectivity of tournaments, Tournaments and Semicomplete Digraphs, Degree sequences forcing Hamilton cycles in directed graphs, Bounds on the $k$-restricted arc connectivity of some bipartite tournaments, Dynamics on binary relations over topological spaces, Disjoint properly colored cycles in edge-colored complete bipartite graphs, Signsolvability revisited, The 2-linkage problem for acyclic digraphs, About some cyclic properties in digraphs, Number of arcs and cycles in digraphs, On hamiltonian line graphs and connectivity, Long cycles in graphs and digraphs, Two proofs of Bermond-Thomassen conjecture for regular tournaments, Connectedness strength of two vertices in an uncertain graph, Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs), Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles, Sign-nonsingular matrices and even cycles in directed graphs

Cites Work