[1] Laurence R. Alvarez: Undirected graphs realizable as graphs of modular lattices. Canad J. Math. 17 (1965), 923-932; MR 32, 56. DOI 10.4153/CJM-1965-088-1 | MR 0182573

[2] P. Erdos L. Gerencsér, A. Maté: Problems of graph theory concerning optimal design. Combinatorial Theory and its Applications. (P. Erdos, A. Rényi and Vera T. Sos, eds.), North Holland, Amsterdam, 1970; MR 48, 170. MR 0321803

[3] P. Erdōs: Some unsolved problems in graph theory and combinatorial analysis. Combinatorial Mathematics and its Applications (D. J. A. Welsh, ed.), Academic Press, London, 1971; MR 43, 3125. MR 0277392

[4] P. Erdōs L. Lovasz A. Simmons, E. G. Straus: Dissection graphs of planar point sets. A Survey of Combinatorial Theory (J. Srivastava et al., eds.). North Holland Publishing Co., Amsterdam, 1973. MR 0363986

[5] T. Gallai: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar. 18 (1967), 25-66; MR 36, 5026. DOI 10.1007/BF02020961 | MR 0221974 | Zbl 0153.26002

[6] T. Gallai: On directed paths and circuits. Theory of Graphs (P. Erdos and G. Katona, eds.), Akadémiai Kiadó, Budapest, 1968; MR 38, 2054. MR 0233733 | Zbl 0159.54403

[7] A. Ghouila-Houri: Characterisation des graphes non orientés dont on peut orienter les arêtes de manière à obtenir le graphe d'une relation d'order. C.R. Acad. Sci. Paris 254 (1962), 1370-1371; MR 30, 2495. MR 0172275

[8] P. С Gillmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. Canad. J. Math. 16 (1964), 539-548; MR 31, 87. DOI 10.4153/CJM-1964-055-5 | MR 0175811

[9] С E. Haff U. S. R. Murty, R. C. Wilton: A note on directed graphs realizable as p.o. sets. Canad. Math. Bull. 13 (1970), 371-374; MR 42, 4444. DOI 10.4153/CMB-1970-070-6 | MR 0269549

[10] S. L. Hakimi: On the degrees of the vertices of a directed graph. J. Franklin Inst. 279 (1965), 290-308; MR 31, 4736. DOI 10.1016/0016-0032(65)90340-6 | MR 0180501 | Zbl 0173.26404

[11] F. Harary: Graph Theory. Addison-Wesley, Reading, Mass., 1969; MR 41, 1566. MR 0256911 | Zbl 0196.27202

[12] Frank Harary, Robert Z. Norman, Dorwin Cartwright: Structural Models: An introduction to the theory of directed graphs. New York, Wiley, 1965; MR 32, 2345. MR 0184874

[13] F. Harary, E. Palmer: On the number of orientations of a given graph. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 14 (1966), 125-128; MR 33, 2562. MR 0194352 | Zbl 0135.42105

[14] F. Harary, E. M. Palmer: Graphical Enumeration. Academic Press, New York, 1974. MR 0357214

[15] Frank Harary, Edgar Palmer, Cedric Smith: Which graphs have only self-converse orientations?. Canad. Math. Bull. 10 (1967), 425-429; MR 35, 2791. DOI 10.4153/CMB-1967-040-0 | MR 0211916

[16] P. W. Kasteleyn: Graph theory and crystal physics. Graph Theory and Theoretical Physics (Frank Harary, ed.), Academic Press, New York, 1967; MR 40, 6903. MR 0253689 | Zbl 0205.28402

[17] A. Lempel: A note on orientation of graphs. Amer. Math. Monthly, 75 (1968), 865-867; MR 38, 3168. DOI 10.2307/2314339 | MR 0234854 | Zbl 0179.29202

[18] Charles H. С Little: Kasteleyn's theorem and arbitrary graphs. Canad. J. Math. 25 (1973), 758-764. DOI 10.4153/CJM-1973-077-1 | MR 0327581

[19] K. M. Mosesjan: A minimal graph that is not strongly basable. (Russian), Akad. Nauk Armjan. SSR Dokl. 54 (1972), 8-12; MR 46, 1637. MR 0302493

[20] J. Mycielski: Sur le colorage des graphes. Colloq. Math. 3 (1955), 161 - 162; MR 16, 1044. DOI 10.4064/cm-3-2-161-162 | MR 0069494

[21] С. St. J. A. Nash-Williams: On orientations, connectivity and odd-vertex-pairings in finite graphs. Canad. J. Math. 12 (1960), 555-567; MR 22, 9455. DOI 10.4153/CJM-1960-049-6 | MR 0118684 | Zbl 0096.38002

[22] С St. J. A. Nash-Williams: Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings. Recent Progress in Combinatorics (W. T. Tutte, ed.), Academic Press, New York, 1968; MR 40, 7146.

[23] Oystein Ore: Theory of Graphs, American Mathematical Society. Providence, R.I., 1962; MR 27, 740. MR 0150753

[24] H. E. Rohbins: A theorem on graphs with an application to a problem of traffic control. Amer. Math. Monthly, 46 (1939), 281-283. DOI 10.2307/2303897 | MR 1524589

[25] E. S. Wölk: The comparability graph of a tree. Proc. Amer. Math. Soc, 13 (1965), 789-795; MR 30, 2493, 2494. MR 0172273

[26] Bohdan Zelinka: Introducing an orientation into a given non-directed graph. Mat.-Fyz. Časopis Sloven. Akad. Vied, 16 (1966), 66-71; MR 34, 4167. MR 0204325