Publications of Paul A. Catlin:

Embedding Subgraphs and Coloring Graphs under Extremal Degree Conditions (Ph. D. Dissertation, Ohio State University, Part 1 and Part 2, Part 3)

List of Publications of Paul A. Catlin:

1. Concerning the iterated F function, Amer. Math. Monthly, 77 (1970) 60-61.

2. On the divisors of second order recurrences, Fibonacci Quart. 12 (1974) 175-178.

3. A lower bound for the period of the Fibonacci series modulo m, Fibonacci Quart. 12 (1974) 349-350.

4. On the multiplication of recurrences, Fibonacci Quart 12 (1974) 365-368.

5. Subgraphs of graphs, I, Discrete math., 10 (1974) 225-233.

6. Two problems in metric Diophantine approximation, I, J. Number Theory 8 (1976) 282-288.

7. Two problems in metric Diophantine approximation, II, J. Number Theory 8 (1976) 289-297.

8. Embedding subgrpahs under extremal degree conditions, Congr. Numer. 19 (1977) 136-145.

9. A bound on the chromatic number of a graph, Discrete Math. 22 (1978) 81-83.

10. Another bound on the chromatics number of a graph, Discrete Math. 24 (1978) 1-6.

11. Graph decomposition satisfying extremal degree constrains, J. Graph Theory 2 (1978) 165-170.

12. Nonisomorphic graphs having the same vertex neighborhood family, Congr. Numer. 21 (1978) 189-193.

13. Subgraphs with triangle components, Discrete Math. 27 (1979) 149-170.

14. Hajos’ graph-coloring conjecture: variations and counterexamples, J. Combin. Theory, Ser. B 26 (1979) 268-274.

15. Brooks’ graph-coloring theorem and the independent number, J. Combin. Theory, Ser. B 27 (1979) 42-48.

16. Survey of extensions of Brooks’ graph-coloring theorem, in: F. Harary (Ed.) Topics in Graph Theory, New York, 1977. Ann. New York Acad. Sci. 328 (1979) 95-99.

17. On the Hajnal-Szemerdi theorem on disjoint cliques, Utilitas Math. 17 (1980) 163-177.

18. Hadwiger’s conjecture is true for almost every graph, (with B. Bollobás and P. Erdős), European J. Combin. 1 (1980) 195-199.

19. Topological cliques of random graphs, (with B. Bollobás) J. Combin. Theory Ser. B 30 (1981) 224-227.

20. Homomorphisms of 3-chromatioc graphs, II, (with M. O. Albertosn and L. Gibbons), Comgr. Numer. 47 (1985) 19-28.

21. Homomorphisms as a generalization of graph coloring, Congr. Numer. 50 (1985) 179-186.

22. Spanning trails, J. Graph Theory 11 (1987) 161-167.

23. Super-Eulerian graphscollapsible graphs, and four-cycles, Congr. Numer. 58 (1987) 233-246.

24. Nearly-Eulerian spanning subgraphs, Ars Combin. 25 (1988) 115-124.

25. Contractions of graphs with no spanning Eulerian subgraphs, Combinatorica 8 (1988) 212-321.

26. A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29-44.

27. Graph homomorphisms onto the 5-cycle, J. Combin. Theory Ser. B 45 (1988) 199-211.

28. Super-Eulerian graphs, Congr. Numer. 64 (1988) 59-72.

29. A reduction method for graphs, Congr. Numer. 65 (1988) 159-169.

30. Graphs with uniform density, (with J. Grossman and A. M. Hobbs), Congr. Numer. 65 (1988) 281-285.

31. Double cycle covers and the Petersen graph, J. Graph Theory 13 (1989) 95-116.

32. Spanning Eulerian subgraphs and matchings, Discrete Math. 76 (1989) 95-116.

33. Eulerian subgraphs in graphs with short cycles, (with H.-J. Lai), Ars Combin. 30 (1990) 177-191.

34. Hamiltonian cycles and closed trails in iterated line graphs, (with T. Iqbalunnisa, T.-N. Janakiraman and N. Srinvasan), J. Graph Theory 14 (1990) 347-364.

35. Graphs without nontrivial collapsible subgraphs, Congr. Numer. 74 (1990) 233-238.

36. Double cycle covers and the Petersen graph, II, Congr. Numer. 76 (1990) 173-181.

37. Embedded graphs, facial colorings, and double cycle covers, in: R. Bodenielk R. Henn (Eds.), Topics in Combinatorics and Graph Theory (Oberwolfach, 1990), Physica-Verlag, Heigelberg, 1990, pp. 185-192.

38. Spanning trails joining two given edges, (with H.-J,.Lai), in: Y. Alavi et al (Eds.), Graph Theory, Combinatorics, and Applications, Vol. 1, Kalamazoo, MI. 1988, Wiley, New York, 1991, 207-222.

39. Non-super-Eulerian graphs with large size, (with Z.-H. Chen), in: Graph Theory, Combinatorics, Algorithms and Applications, (San Francisco, CA, 1989), SIAM Philadelphia, PA. 1991, pp. 83-95.

40. The arbricity of the random graph, (with Z.-H. Chen), in: Graph Theory, Combinatorics, Algorithms and Applications, (San Francisco, CA, 1989), SIAM Philadelphia, PA. 1991, pp. 119-124.

41. Fractional arboricity, strength and principal partition in graphs and matroids, (with J. W. Grossman, A. M. Hobbs and H.-J. Lai), Discrete Appl. Math. 40 (1992) 285-302.

42. Super-Eulerian graphs, a survey, J. Graph Theory 16 (1992) 177-196.

43. On the edge-arboricity of a random graph, (with Z.-H. Chen and E. M. Palmer), Ars. Combin. A35 (1993) 129-134.

44. Double cycle covers and the Petersen graph, III, in Y. Alavi, A. Schwenk (Eds.) Graph Theory,. Combinatorics and Applications, Vol. 1, Wiley, New York, 1995, pp. 181-182.

45. Supereulerian grpah and the Petersen graph, (with H.-J. Lai), J. Combin. Theory Ser. B 66 (1996) 123-139.

46. Vertex arboricity and maximum degree, (with H.-J. Lai), Discrete Math. 160 (1995) 37-46.

47. The reduction of graph families under contraction, Discrete Mathematics, 160 (1996) 67-80.

48. Graphs without spanning closed trails, (with Z. Han and H.-J. Lai), Discrete Math. 160 (1996), 81-91.

49. Edge-connectivity and edge-disjoint spanning trees, preprint.

50. Supereulerian graphs of minimum degree at least 4, (with Xiangwen Li), Advances in Mathematics, 28 (1999) 65-69.

51. A reduction criterion for supereulerian graphs, J. Graph Theory, 22 (1996) 151-153.