Even cycles in directed graphs
From MaRDI portal
Publication:1084409
DOI10.1016/S0195-6698(85)80025-1zbMath0606.05039MaRDI QIDQ1084409
Publication date: 1985
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
Unnamed Item, Signsolvability revisited, Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Degree and local connectivity in digraphs, Sign-nonsingular matrices and even cycles in directed graphs, Cycles of length 0 modulo k in directed graphs, A note on odd/even cycles, Every 7-regular digraph contains an even cycle, Square critically 3-chromatic hypergraphs, Regularity of matrices in min-algebra and its time-complexity, Strong orientations without even directed circuits, Note on alternating directed cycles, Existence of vertices of local connectivity \(k\) in digraphs of large outdegree, Directed path-width and monotonicity in digraph searching, Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404], Rank decompositions and signed bigraphs, A note on complete subdivisions in digraphs of large outdegree, The Even Cycle Problem for Directed Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signsolvability revisited
- The directed subgraph homeomorphism problem
- An application of connectivity theory in graphs to factorizations of elements in groups
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Grad und lokaler Zusammenhang in endlichen Graphen
- Graph decomposition with applications to subdivisions and path systems modulo k
- Cycles in digraphs– a survey
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Paths, Trees, and Flowers
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- On minimal regular digraphs with given girth
