Geodesic
Which Graphs have only Self-Converse Orientations?
Canadian mathematical bulletin, Tome 10 (1967) no. 3, pp. 425-429

Voir la notice de l'article provenant de la source Cambridge

DOI

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). 
Harary, Frank; Palmer, Edgar; Smith, Cedric. Which Graphs have only Self-Converse Orientations?. Canadian mathematical bulletin, Tome 10 (1967) no. 3, pp. 425-429. doi: 10.4153/CMB-1967-040-0
@article{10_4153_CMB_1967_040_0,
     author = {Harary, Frank and Palmer, Edgar and Smith, Cedric},
     title = {Which {Graphs} have only {Self-Converse} {Orientations?}},
     journal = {Canadian mathematical bulletin},
     pages = {425--429},
     year = {1967},
     volume = {10},
     number = {3},
     doi = {10.4153/CMB-1967-040-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-040-0/}
}
TY  - JOUR
AU  - Harary, Frank
AU  - Palmer, Edgar
AU  - Smith, Cedric
TI  - Which Graphs have only Self-Converse Orientations?
JO  - Canadian mathematical bulletin
PY  - 1967
SP  - 425
EP  - 429
VL  - 10
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-040-0/
DO  - 10.4153/CMB-1967-040-0
ID  - 10_4153_CMB_1967_040_0
ER  - 
%0 Journal Article
%A Harary, Frank
%A Palmer, Edgar
%A Smith, Cedric
%T Which Graphs have only Self-Converse Orientations?
%J Canadian mathematical bulletin
%D 1967
%P 425-429
%V 10
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-040-0/
%R 10.4153/CMB-1967-040-0
%F 10_4153_CMB_1967_040_0

Cité par Sources :