The Turàn number of the graph 3P4
Halina Bielak; Sebastian Kieliszek
Annales UMCS, Mathematica (2014)
- Volume: 68, Issue: 1, page 21-29
- ISSN: 2083-7402
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] Bushaw, N., Kettle, N., Tur´an numbers of multiple paths and equibipartite forests, Combin. Probab. Comput. 20 (2011), 837-853. Zbl1234.05128
- [2] Erd˝os, P., Gallai, T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337-356. Zbl0090.39401
- [3] Faudree, R. J., Schelp, R. H., Path Ramsey numbers in multicolorings, J. Combin. Theory Ser. B 19 (1975), 150-160. Zbl0286.05111
- [4] Gorgol, I., Tur´an numbers for disjoint copies of graphs, Graphs Combin. 27 (2011), 661-667.[WoS][Crossref] Zbl1234.05129
- [5] Harary, F., Graph Theory, Addison-Wesley, Mass.-Menlo Park, Calif.-London, 1969.