Strong orientations without even directed circuits
From MaRDI portal
Publication:1584319
DOI10.1016/S0012-365X(97)00247-1zbMATH Open0957.05048OpenAlexW2109515824MaRDI QIDQ1584319FDOQ1584319
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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- A characterization of convertible (0,1)-matrices
- Permanents, Pfaffian orientations, and even directed circuits
- Title not available (Why is that?)
- The complexity of computing the permanent
- Signsolvability revisited
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Title not available (Why is that?)
- Even cycles in directed graphs
- Title not available (Why is that?)
- An orientation theorem for graphs
- Characterization of even directed graphs
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Modularity of cycles and paths in graphs
- Homomorphisms of graphs into odd cycles
- The Even Cycle Problem for Planar Digraphs
- Title not available (Why is that?)
Cited In (7)
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)