Graphs Omitting a Finite Set of Cycles

Journal of Graph Theory

Volumn 21, Issue 3, 1996, Pages 351-355

  Cherlin, Gregory ^a   Shi, Niandong ^b  

^a RUTGERS UNIVERSITY   (United States)

^b EAST STROUDSBURG UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030543610     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199603)21:3<351::AID-JGT11>3.0.CO;2-K     Document Type: Article

References (9)

1. G. Cherlin and P. Komjáth, There is no universal countable pentagon-free graph, J. Graph Theory 18 (1994), 337-341.
2. G. Cherlin and N. Shi, Graphs omitting sums of complete graphs, preprint (1994).
3. G. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. (3) 2 (1952), 69-81.
4. M. Goldstern and M. Kojman, Universal bridge free graphs, preprint (1994).
5. A. Hajnal and J. Pach, Monochromatic paths in infinite graphs, in: Finite and Infinite Sets, Coll. Math. Soc. J. Bolyai, Eger, Hungary, (1981), 359-369.
6. P. Komjáth, A. Mekler, and J. Pach, Some universal graphs, Israel J. Math. 64 (1988), 158-168.
7. P. Komjáth and J. Pach, Universal elements and the complexity of certain classes of infinite graphs, Discrete Math. 95 (1991), 255-270.
8. A. Lachlan and R. Woodrow, Countable ultrahomogeneous undirected graphs, Trans. Amer. Math. Soc. 262 (1980), 51-94.
9. R. Rado, Universal graphs and universal functions, Acta. Arith. 9 (1964), 331-340.