An orientation theorem for graphs (Q1338310): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.1994.1064 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042934764 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.1994.1064 / rank | |||
Normal rank | |||
Latest revision as of 18:22, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An orientation theorem for graphs |
scientific article |
Statements
An orientation theorem for graphs (English)
0 references
2 March 1995
0 references
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.
0 references
orientation
0 references
Tutte's characterization
0 references
regular matroids
0 references
