Geodesic
Characterizations of graphs having orientations satisfying local degree restrictions
Czechoslovak Mathematical Journal, Tome 28 (1978) no. 1, pp. 108-119

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CMJ.1978.101517
Classification : 05C99 
Entringer, Roger C.; Tolman, L. Kirk. Characterizations of graphs having orientations satisfying local degree restrictions. Czechoslovak Mathematical Journal, Tome 28 (1978) no. 1, pp. 108-119. doi: 10.21136/CMJ.1978.101517
@article{10_21136_CMJ_1978_101517,
     author = {Entringer, Roger C. and Tolman, L. Kirk},
     title = {Characterizations of graphs having orientations satisfying local degree restrictions},
     journal = {Czechoslovak Mathematical Journal},
     pages = {108--119},
     year = {1978},
     volume = {28},
     number = {1},
     doi = {10.21136/CMJ.1978.101517},
     mrnumber = {0491345},
     zbl = {0375.05028},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1978.101517/}
}
TY  - JOUR
AU  - Entringer, Roger C.
AU  - Tolman, L. Kirk
TI  - Characterizations of graphs having orientations satisfying local degree restrictions
JO  - Czechoslovak Mathematical Journal
PY  - 1978
SP  - 108
EP  - 119
VL  - 28
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1978.101517/
DO  - 10.21136/CMJ.1978.101517
LA  - en
ID  - 10_21136_CMJ_1978_101517
ER  - 
%0 Journal Article
%A Entringer, Roger C.
%A Tolman, L. Kirk
%T Characterizations of graphs having orientations satisfying local degree restrictions
%J Czechoslovak Mathematical Journal
%D 1978
%P 108-119
%V 28
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1978.101517/
%R 10.21136/CMJ.1978.101517
%G en
%F 10_21136_CMJ_1978_101517

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

[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

[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

[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

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

[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 | Zbl

[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

[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 | MR

[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 | MR

[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 | MR | Zbl

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

[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

[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 | Zbl

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

[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 | MR

[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 | Zbl

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

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

[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

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

[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 | MR | Zbl

[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

[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 | MR

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

[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

Cité par Sources :