Characterization of even directed graphs

DOI10.1016/0095-8956(87)90061-XzbMath0607.05037MaRDI QIDQ1085177

Carsten Thomassen, P. D. Seymour

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

even cycles; directed graphs; cycle bases

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

Related Items

Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Solving linear programs from sign patterns, Sign-solvable linear complementarity problems, Sign-nonsingular matrices and even cycles in directed graphs, A note on odd/even cycles, When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse, The symbiotic relationship of combinatorics and matrix theory, Matching theory -- a sampler: From Dénes König to the present, On the permanent of certain \((0,1)\) Toeplitz matrices, On the digraphs of sign solvable linear systems, Strong orientations without even directed circuits, On digraphs and forbidden configurations of strong sign nonsingular matrices, A new proof of a characterisation of Pfaffian bipartite graphs, Nearly sign-nonsingular matrices, Convertible, nearly decomposable, and nearly reducible matrices, Classes of sign nonsingular matrices with a specified number of zero entries, On maximal sign-nonsingular matrices, The Even Cycle Problem for Directed Graphs

Cites Work

• Signsolvability revisited
• The 2-linkage problem for acyclic digraphs
• Sign-nonsingular matrices and even cycles in directed graphs
• The directed subgraph homeomorphism problem
• On digraphs with the odd cycle property
• Cycles in digraphs– a survey
• ON THE TWO-COLOURING OF HYPERGRAPHS
• A Solution of the Shannon Switching Game