1. L.W. Beineke and F. Harary. The thickness of the complete graph, Canad. J. Math. 17 (1965), 850–859.
2. G. Chartrand and J.B. Frechen, On the chromatic number of permutation graphs, Proof Techniques in Graph Theory, (F. Harary, ed.), Academic Press, New York, 1969 (to appear).
3. G. Chartrand, D. Geller, S. Hedetniemi, Graphs with forbidden subgraphs, J. Combinatorial Theory, (to appear).
4. G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincaré, Vol. IIIB (1967), 433–438.
5. T. Gallai, Kritische Graphen I, II, Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 (1963), 165–192, and (1964) 373–395.