The Even Cycle Problem for Directed Graphs
From MaRDI portal
Publication:3993798
DOI10.2307/2152767zbMath0760.05051OpenAlexW4246392477MaRDI QIDQ3993798
Publication date: 13 August 1992
Full work available at URL: https://doi.org/10.2307/2152767
Hypergraphs (05C65) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items
Regularity of matrices in min-algebra and its time-complexity, Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs, Singular values, doubly stochastic matrices, and applications, Coloring and the Lovász local lemma, Hypergraph colouring and the Lovász local lemma, Blocking set free configurations and their relations to digraphs and hypergraphs, Partitioning claw-free subcubic graphs into two dominating sets, Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree, Algorithmic complexity of proper labeling problems, On 2-Colorings of Hypergraphs, On proper colorings of hypergraphs, On the dynamic coloring of graphs, Out-degree reducing partitions of digraphs, Tropical patterns of matrices and the Gondran-Minoux rank function, Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs, On existence theorems, Pseudo 2-factor isomorphic regular bipartite graphs, Color-blind index in graphs of very low degree, What is on his mind?, Dynamic chromatic number of regular graphs, Greedy colorings of uniform hypergraphs, Partitioning the vertices of a cubic graph into two total dominating sets, 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs, Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications, Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404], On digraphs and forbidden configurations of strong sign nonsingular matrices, Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph, The 1-2-3-Conjecture for Hypergraphs, Square critically 3-chromatic hypergraphs, On maximal sign-nonsingular matrices, On the digraphs of sign solvable linear systems, Note on alternating directed cycles, The S\(^2\)NS digraphs and the cycle linear system of a digraph, On 2-coloring certain \(k\)-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Signsolvability revisited
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Sign-nonsingular matrices and even cycles in directed graphs
- Regular subgraphs of dense graphs
- Even cycles in directed graphs
- Characterization of even directed graphs
- Cycles of length 0 modulo k in directed graphs
- Matching structure and the matching lattice
- Every 7-regular digraph contains an even cycle
- The Even Cycle Problem for Planar Digraphs
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Perfect matchings in hexagonal systems
