Strong orientations without even directed circuits

DOI10.1016/S0012-365X(97)00247-1MaRDI QIDQ1584319zbMATH OpenOpenAlexFDO

Authors 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

signed graphsconnectivitypolynomial-time algorithmstrongly connected orientation

Mathematics Subject Classification ID

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

Recommendations

• Strongly 2-connected orientations of graphs
• Graphs for which all strong orientations are Eulerian
• Graph orientations with edge-connection and parity constraints
• Even circuits of prescribed clockwise parity
• Even circuits in oriented matroids

Cites work

• scientific article; zbMATH DE number 49899 (Why is no real title available?)
• scientific article; zbMATH DE number 3517179 (Why is no real title available?)
• scientific article; zbMATH DE number 1263264 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• A characterization of convertible (0,1)-matrices
• An orientation theorem for graphs
• Characterization of even directed graphs
• Even cycles in directed graphs
• Homomorphisms of graphs into odd cycles
• Modularity of cycles and paths in graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Permanents, Pfaffian orientations, and even directed circuits
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Signsolvability revisited
• The Even Cycle Problem for Planar Digraphs
• The complexity of computing the permanent

Cited in

(7)

• Some remarks on cycles in graphs and digraphs
• An orientation theorem for graphs
• scientific article; zbMATH DE number 2192144 (Why is no real title available?)
• Strongly 2-connected orientations of graphs
• Even circuits in oriented matroids
• Graphs for which all strong orientations are Eulerian
• Orientations with single source and sink

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584319)