An orientation theorem for graphs
type: Item
instance of: scholarly article
title: An orientation theorem for graphs
zbMATH Open document ID: 0807.05020
author: A. M. H. Gerards
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-03-02T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/2237
review text: We characterize the class of graphs in which the edges can be oriented in such a way that going along any circuit in the graph, the number of forward edges minus the number of backward edges is equal to 0, 1, or \(- 1\). The result follows by applying Tutte's characterization of regular matroids to a certain binary matroid associated to a graph.
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 696907
zbMATH Keywords: orientation
zbMATH Keywords: Tutte's characterization
zbMATH Keywords: regular matroids
MaRDI profile type: Publication
OpenAlex ID: W2042934764
DOI: 10.1006/JCTB.1994.1064
description: scientific article; zbMATH DE number 696907