Cycles in digraphs– a survey
From MaRDI portal
Publication:3907591
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites work
- Chemins Et Circuits Dans Les Graphes Orientes
- Cycles in k-strong tournaments
- Cycles of Each Length in Regular Tournaments
- scientific article; zbMATH DE number 3681789 (Why is no real title available?)
- scientific article; zbMATH DE number 3611388 (Why is no real title available?)
- scientific article; zbMATH DE number 3451870 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3316740 (Why is no real title available?)
- Long Cycles in Digraphs
- On Edge-Disjoint Cycles in a Graph
- On Independent Circuits Contained in a Graph
- On Sets of Consistent Arcs in a Tournament
- On the Distribution of 4-Cycles in Random Bipartite Tournaments
- Paths and Cycles in Oriented Graphs
- The Maximum Number of Strongly Connected Subtournaments*
Cited in
(only showing first 100 items - show all)- 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
- An improved bound for disjoint directed cycles
- Disjoint cycles of different lengths in graphs and digraphs
- Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture
- Vertex disjoint 4-cycles in bipartite tournaments
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On the number of disjoint 4-cycles in regular tournaments
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
- \(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
- 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
- Properly colored short cycles in edge-colored graphs
- Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments
- Disjoint properly colored cycles in edge-colored complete bipartite graphs
- On disjoint cycles of the same length in tournaments
- Vertex-disjoint rainbow cycles in edge-colored graphs
- On \(d\)-panconnected tournaments with large semidegrees
- Lichiardopol's conjecture on disjoint cycles in tournaments
- Subdivisions in digraphs of large out-degree or large dichromatic number
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- Dynamics on binary relations over topological spaces
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Disjoint cycles with different length in 4-arc-dominated digraphs
- Multipartite tournaments: a survey
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- Trail-connected tournaments
- Turán problems for \(k\)-geodetic digraphs
- Partition and disjoint cycles in digraphs
- Degree sequences forcing Hamilton cycles in directed graphs
- Connectedness strength of two vertices in an uncertain graph
- Long cycles in subgraphs of (pseudo)random directed graphs
- Tournaments and Semicomplete Digraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Long cycles in graphs and digraphs
- Two proofs of Bermond-Thomassen conjecture for regular tournaments
- A degree condition for cycles of maximum length in bipartite digraphs
- A survey on Hamilton cycles in directed graphs
- Vertex-disjoint cycles in regular tournaments
- Euler index in uncertain graph
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
- On the number of vertex-disjoint cycles in digraphs
- Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
- All Circuits Enumeration in Macro-Econometric Models
- On dominating even subgraphs in cubic graphs
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Euler index of uncertain random graph: concepts and properties
- Vertex-disjoint cycles in bipartite tournaments
- Vertex-disjoint cycles in bipartite tournaments
- Disjoint cycles in digraphs
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- Properly colored cycles of different lengths in edge-colored complete graphs
- 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
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
- Vertex‐disjoint cycles of the same length in tournaments
- Edge-disjoint properly colored cycles in edge-colored complete graphs
- Disjoint cycles in tournaments and bipartite tournaments
- Note on disjoint cycles in multipartite tournaments
- How many conjectures can you stand? A survey
- A new sufficient condition for a 2-strong digraph to be Hamiltonian
- Cycle-pancyclism in tournaments. III
- On partitions of edge-colored graphs under color degree constraints
- Strong k-transitive oriented graphs with large minimum degree
- Extremal results on disjoint cycles in tournaments and bipartite tournaments
- On three conjectures of Thomassen and the extremal digraphs for two conjectures of Nash-Williams
- Ear decomposition for pair comparison data
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree
- Unavoidable subgraphs in digraphs with large out-degrees
- On \(d\)-arc-dominated oriented graphs
- Signsolvability revisited
This page was built for publication: Cycles in digraphs– a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3907591)
