Strong orientations without even directed circuits

DOI10.1016/S0012-365X(97)00247-1zbMath0957.05048OpenAlexW2109515824MaRDI QIDQ1584319

A. M. H. Gerards, F. Bruce Shepherd

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00247-1

zbMATH Keywords

connectivitypolynomial-time algorithmsigned graphsstrongly connected orientation

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Signsolvability revisited
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Even cycles in directed graphs
• Characterization of even directed graphs
• An orientation theorem for graphs
• A characterization of convertible (0,1)-matrices
• Permanents, Pfaffian orientations, and even directed circuits
• Homomorphisms of graphs into odd cycles
• The Even Cycle Problem for Planar Digraphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Modularity of cycles and paths in graphs

This page was built for publication: Strong orientations without even directed circuits