Characterizations of graphs having orientations satisfying local degree restrictions

Roger C. Entringer; L. Kirk Tolman

Czechoslovak Mathematical Journal (1978)

  • Volume: 28, Issue: 1, page 108-119
  • ISSN: 0011-4642

How to cite

top

Entringer, Roger C., and Tolman, L. Kirk. "Characterizations of graphs having orientations satisfying local degree restrictions." Czechoslovak Mathematical Journal 28.1 (1978): 108-119. <http://eudml.org/doc/13048>.

@article{Entringer1978,
author = {Entringer, Roger C., Tolman, L. Kirk},
journal = {Czechoslovak Mathematical Journal},
language = {eng},
number = {1},
pages = {108-119},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Characterizations of graphs having orientations satisfying local degree restrictions},
url = {http://eudml.org/doc/13048},
volume = {28},
year = {1978},
}

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
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 28
IS - 1
SP - 108
EP - 119
LA - eng
UR - http://eudml.org/doc/13048
ER -

References

top
  1. Laurence R. Alvarez, 10.4153/CJM-1965-088-1, Canad J. Math. 17 (1965), 923-932; MR 32, 56. (1965) MR0182573DOI10.4153/CJM-1965-088-1
  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. (1970) MR0321803
  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. (1971) MR0277392
  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. (1973) MR0363986
  5. T. Gallai, 10.1007/BF02020961, Acta Math. Acad. Sci. Hungar. 18 (1967), 25-66; MR 36, 5026. (1967) Zbl0153.26002MR0221974DOI10.1007/BF02020961
  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. (1968) Zbl0159.54403MR0233733
  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. (1962) MR0172275
  8. P. С Gillmore, A. J. Hoffman, 10.4153/CJM-1964-055-5, Canad. J. Math. 16 (1964), 539-548; MR 31, 87. (1964) MR0175811DOI10.4153/CJM-1964-055-5
  9. С E. Haff U. S. R. Murty, R. C. Wilton, 10.4153/CMB-1970-070-6, Canad. Math. Bull. 13 (1970), 371-374; MR 42, 4444. (1970) MR0269549DOI10.4153/CMB-1970-070-6
  10. S. L. Hakimi, 10.1016/0016-0032(65)90340-6, J. Franklin Inst. 279 (1965), 290-308; MR 31, 4736. (1965) Zbl0173.26404MR0180501DOI10.1016/0016-0032(65)90340-6
  11. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969; MR 41, 1566. (1969) Zbl0196.27202MR0256911
  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. (1965) MR0184874
  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. (1966) Zbl0135.42105MR0194352
  14. F. Harary, E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1974. (1974) MR0357214
  15. Frank Harary, Edgar Palmer, Cedric Smith, 10.4153/CMB-1967-040-0, Canad. Math. Bull. 10 (1967), 425-429; MR 35, 2791. (1967) MR0211916DOI10.4153/CMB-1967-040-0
  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. (1967) Zbl0205.28402MR0253689
  17. A. Lempel, 10.2307/2314339, Amer. Math. Monthly, 75 (1968), 865-867; MR 38, 3168. (1968) Zbl0179.29202MR0234854DOI10.2307/2314339
  18. Charles H. С Little, 10.4153/CJM-1973-077-1, Canad. J. Math. 25 (1973), 758-764. (1973) MR0327581DOI10.4153/CJM-1973-077-1
  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. (1972) MR0302493
  20. J. Mycielski, 10.4064/cm-3-2-161-162, Colloq. Math. 3 (1955), 161 - 162; MR 16, 1044. (1955) MR0069494DOI10.4064/cm-3-2-161-162
  21. С. St. J. A. Nash-Williams, 10.4153/CJM-1960-049-6, Canad. J. Math. 12 (1960), 555-567; MR 22, 9455. (1960) Zbl0096.38002MR0118684DOI10.4153/CJM-1960-049-6
  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. (1968) 
  23. Oystein Ore, Theory of Graphs, American Mathematical Society, Providence, R.I., 1962; MR 27, 740. (1962) MR0150753
  24. H. E. Rohbins, 10.2307/2303897, Amer. Math. Monthly, 46 (1939), 281-283. (1939) MR1524589DOI10.2307/2303897
  25. E. S. Wölk, The comparability graph of a tree, Proc. Amer. Math. Soc, 13 (1965), 789-795; MR 30, 2493, 2494. (1965) MR0172273
  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. (1966) MR0204325

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.