Even cycles in directed graphs
From MaRDI portal
Publication:1084409
DOI10.1016/S0195-6698(85)80025-1zbMATH Open0606.05039MaRDI QIDQ1084409FDOQ1084409
Authors: Carsten Thomassen 
Publication date: 1985
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Cites Work
- Paths, Trees, and Flowers
- The directed subgraph homeomorphism problem
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Signsolvability revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Graph decomposition with applications to subdivisions and path systems modulo k
- Title not available (Why is that?)
- Cycles in digraphs– a survey
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- ON THE TWO-COLOURING OF HYPERGRAPHS
- An application of connectivity theory in graphs to factorizations of elements in groups
- On minimal regular digraphs with given girth
- Grad und lokaler Zusammenhang in endlichen Graphen
Cited In (49)
- Subdivisions of digraphs in tournaments
- Immersion of complete digraphs in Eulerian digraphs
- Cycles of length 0 modulo k in directed graphs
- Even and odd Eulerian paths.
- Every 7-regular digraph contains an even cycle
- On spanning galaxies in digraphs
- Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs
- Openly disjoint circuits through a vertex in regular digraphs
- The Hoàng-Reed conjecture for \(\delta ^{+}=3\)
- Even dicycles
- Immersing complete digraphs
- Signsolvability revisited
- General models for variations of the even cycle problem
- Sign-nonsingular matrices and even cycles in directed graphs
- Immersion of transitive tournaments in digraphs with large minimum outdegree
- A note on odd/even cycles
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
- Rank decompositions and signed bigraphs
- Degree and local connectivity in digraphs
- Square critically 3-chromatic hypergraphs
- Hamilton-connectivity of line graphs with application to their detour index
- Shortest odd paths in undirected graphs with conservative weight functions
- Finding even cycles even faster
- Strong complete minors in digraphs
- Even Cycles in Directed Graphs
- Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
- Antidirected subgraphs of oriented graphs
- Directed path-width and monotonicity in digraph searching
- Equilibria of graphical games with symmetries
- Even circuits in oriented matroids
- What is on his mind?
- Colouring non-even digraphs
- The Even Cycle Problem for Directed Graphs
- Regularity of matrices in min-algebra and its time-complexity
- On splitting digraphs
- Existence of openly disjoint circuits through a vertex
- Dichromatic number and forced subdivisions
- Spanning galaxies in digraphs
- Highly linked tournaments with large minimum out-degree
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Finding good 2-partitions of digraphs. II. Enumerable properties
- Out-degree reducing partitions of digraphs
- Forbidding induced even cycles in a graph: typical structure and counting
- Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]
- A remark on ranks of sign patterns
- A note on complete subdivisions in digraphs of large outdegree
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- Note on alternating directed cycles
- Strong orientations without even directed circuits
This page was built for publication: Even cycles in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084409)
