Article contents
Which Graphs have only Self-Converse Orientations?
Published online by Cambridge University Press: 20 November 2018
Extract
An orientation of a graph G is an assignment of a unique direction to each line of G. The result is called an oriented graph. Two orientations of a graph are regarded as equivalent if the resulting oriented graphs are isomorphic as directed graphs. For example, the graph C3 consisting of a cycle of length 3 (a triangle) shown in Figure 1(a), has exactly two orientations D1 and D2; see Figure 1(b) and (c).
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1967
References
- 5
- Cited by