A note on “The comparability graph of a tree”
HTML articles powered by AMS MathViewer
- by E. S. Wolk PDF
- Proc. Amer. Math. Soc. 16 (1965), 17-20 Request permission
References
- Ben Dushnik and E. W. Miller, Partially ordered sets, Amer. J. Math. 63 (1941), 600–610. MR 4862, DOI 10.2307/2371374
- Alain Ghouila-Houri, Caractérisation des graphes non orientés dont on peut orienter les arětes de manière à obtenir le graphe d’une relation d’ordre, C. R. Acad. Sci. Paris 254 (1962), 1370–1371 (French). MR 172275
- P. C. Gilmore and A. J. Hoffman, A characterization of comparability graphs and of interval graphs, Canadian J. Math. 16 (1964), 539–548. MR 175811, DOI 10.4153/CJM-1964-055-5
- W. H. Gottschalk, Choice functions and Tychonoff’s theorem, Proc. Amer. Math. Soc. 2 (1951), 172. MR 40376, DOI 10.1090/S0002-9939-1951-0040376-X
- Oystein Ore, Theory of graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, R.I., 1962. MR 0150753
- R. Rado, Axiomatic treatment of rank in infinite sets, Canad. J. Math. 1 (1949), 337–343. MR 31993, DOI 10.4153/cjm-1949-031-1
- E. S. Wolk, The comparability graph of a tree, Proc. Amer. Math. Soc. 13 (1962), 789–795. MR 172273, DOI 10.1090/S0002-9939-1962-0172273-0
Additional Information
- © Copyright 1965 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 16 (1965), 17-20
- MSC: Primary 55.10; Secondary 05.45
- DOI: https://doi.org/10.1090/S0002-9939-1965-0172274-5
- MathSciNet review: 0172274