Cycles in digraphs– a survey
From MaRDI portal
Publication:3907591
DOI10.1002/jgt.3190050102zbMath0458.05035MaRDI QIDQ3907591
Jean-Claude Bermond, Carsten Thomassen
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
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
All Circuits Enumeration in Macro-Econometric Models, Disjoint cycles in digraphs, Cycle-pancyclism in tournaments. III, Ear decomposition for pair comparison data, Signsolvability revisited, Number of arcs and cycles in digraphs, On hamiltonian line graphs and connectivity, Almost symmetric cycles in large digraphs, Cycles and paths of many lengths in bipartite digraphs, The 2-linkage problem for acyclic digraphs, About some cyclic properties in digraphs, Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs), Sign-nonsingular matrices and even cycles in directed graphs, A sufficient condition for oriented graphs to be Hamiltonian, Even cycles in directed graphs, Characterization of even directed graphs, Counterexamples to Adám's conjecture on arc reversals in directed graphs, On digraphs with no two disjoint directed cycles, Cycles of length 0 modulo k in directed graphs, Bounds of the longest directed cycle length for minimal strong digraphs, Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs, Cycles in strong oriented graphs, Longest paths in digraphs, Degrees and cycles in digraphs, Highly connected non-2-linked digraphs, Kings in \(k\)-partite tournaments, Hamiltonian paths and cycles, number of arcs and independence number in digraphs, Orientations of Hamiltonian cycles in bipartite digraphs, An upper bound for the Hamiltonicity exponent of finite digraphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, \(G\)-designs and related designs, The reversing number of a digraph, Cycle-pancyclism in tournaments. I, Cycle packings in graphs and digraphs, Cycle-pancyclism in tournaments. II, Multipartite tournaments: a survey, Cycles in a tournament with pairwise zero, one or two given vertices in common, Long cycles in graphs and digraphs, Two proofs of Bermond-Thomassen conjecture for regular tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles in k-strong tournaments
- On the Distribution of 4-Cycles in Random Bipartite Tournaments
- Paths and Cycles in Oriented Graphs
- Chemins Et Circuits Dans Les Graphes Orientes
- Long Cycles in Digraphs
- On Independent Circuits Contained in a Graph
- The Maximum Number of Strongly Connected Subtournaments*
- On Sets of Consistent Arcs in a Tournament
- On Edge-Disjoint Cycles in a Graph
- Cycles of Each Length in Regular Tournaments
