Strong orientations without even directed circuits
type: Item
instance of: scholarly article
title: Strong orientations without even directed circuits
zbMATH Open document ID: 0957.05048
DOI: 10.1016/S0012-365X(97)00247-1
author: A. M. H. Gerards
author: F. Bruce Shepherd
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 1524912
zbMATH Keywords: connectivity
zbMATH Keywords: signed graphs
zbMATH Keywords: strongly connected orientation
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
cites work: Modularity of cycles and paths in graphs
cites work: Q4234137
cites work: Homomorphisms of graphs into odd cycles
cites work: Q3999620
cites work: An orientation theorem for graphs
cites work: Q5605168
cites work: Signsolvability revisited
cites work: Q4097310
cites work: A characterization of convertible (0,1)-matrices
cites work: Permanents, Pfaffian orientations, and even directed circuits
cites work: ON THE TWO-COLOURING OF HYPERGRAPHS
cites work: Characterization of even directed graphs
cites work: Even cycles in directed graphs
cites work: The Even Cycle Problem for Planar Digraphs
cites work: The complexity of computing the permanent
cites work: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
full work available at URL: s0012-365x(97)00247-1
OpenAlex ID: W2109515824
description: scientific article; zbMATH DE number 1524912