Characterization of even directed graphs

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

Carsten Thomassen, P. D. Seymour

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90061-x

zbMATH Keywords

even cyclesdirected graphscycle bases

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items

Convertible, nearly decomposable, and nearly reducible matrices ⋮ Even circuits in oriented matroids ⋮ Nearly sign-nonsingular matrices ⋮ On the permanent of certain \((0,1)\) Toeplitz matrices ⋮ A note on odd/even cycles ⋮ When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse ⋮ Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Forward and line-based cycle bases for periodic timetabling ⋮ Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs ⋮ Solving linear programs from sign patterns ⋮ Sign-solvable linear complementarity problems ⋮ Packing directed circuits exactly ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ The Even Cycle Problem for Directed Graphs ⋮ On digraphs and forbidden configurations of strong sign nonsingular matrices ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ The Parity Hamiltonian Cycle Problem in Directed Graphs ⋮ A new proof of a characterisation of Pfaffian bipartite graphs ⋮ Classes of sign nonsingular matrices with a specified number of zero entries ⋮ On maximal sign-nonsingular matrices ⋮ On the digraphs of sign solvable linear systems ⋮ Strong orientations without even directed circuits ⋮ Colouring non-even digraphs ⋮ Sign-nonsingular matrices and even cycles in 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