The Even Cycle Problem for Directed Graphs

DOI10.2307/2152767zbMath0760.05051MaRDI QIDQ3993798

Carsten Thomassen

Publication date: 13 August 1992

Full work available at URL: https://doi.org/10.2307/2152767

zbMATH Keywords

permanents; hypergraphs; directed graphs; sign-nonsingular matrices; even cycle problem

Mathematics Subject Classification ID

05C65: Hypergraphs

05C38: Paths and cycles

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

On existence theorems, Square critically 3-chromatic hypergraphs, Regularity of matrices in min-algebra and its time-complexity, Hypergraph colouring and the Lovász local lemma, Blocking set free configurations and their relations to digraphs and hypergraphs, On the digraphs of sign solvable linear systems, Note on alternating directed cycles, On digraphs and forbidden configurations of strong sign nonsingular matrices, Singular values, doubly stochastic matrices, and applications, On maximal sign-nonsingular matrices

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