{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:53:38Z","timestamp":1772942018412,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1007\/bf01788524","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:38:32Z","timestamp":1119206312000},"page":"1-6","source":"Crossref","is-referenced-by-count":16,"title":["Goodness of trees for generalized books"],"prefix":"10.1007","volume":"3","author":[{"given":"S. A.","family":"Burr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Erd\u00f6s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. J.","family":"Faudree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. C.","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. H.","family":"Schelp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. J.","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01788524_CR1","unstructured":"Behzad, M., Chartrand, G., Lesniak-Foster, L.: Graphs & Digraphs. Belmont, CA: Wadsworth 1979"},{"key":"BF01788524_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1090\/S0002-9947-1982-0637704-5","volume":"269","author":"S.A. Burr","year":"1982","unstructured":"Burr, S.A., Erd\u00f6s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Ramsey numbers for the pair sparse graph path or cycle. Trans. Amer. Math. Soc.269, 501\u2013512 (1982)","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01788524_CR3","doi-asserted-by":"crossref","unstructured":"Burr, S.A., Erd\u00f6s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Some complete bipartite graphs\u2014tree Ramsey numbers. Proc. First Danish Intl. Conf. on Graph Theory (to appear)","DOI":"10.1016\/S0167-5060(08)70452-7"},{"key":"BF01788524_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1002\/jgt.3190070404","volume":"7","author":"S.A. Burr","year":"1983","unstructured":"Burr, S.A., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: On Ramsey numbers involving starlike multipartite graphs. J. Graph Theory7, 395\u2013409 (1983)","journal-title":"J. Graph Theory"},{"key":"BF01788524_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jgt.3190010118","volume":"1","author":"V. Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V.: Tree-complete graph Ramsey numbers. J. Graph Theory1, 93 (1977)","journal-title":"J. Graph Theory"},{"key":"BF01788524_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02579245","volume":"5","author":"P. Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Multipartite graph-sparse graph Ramsey numbers Combinatorica5, 311\u2013318 (1985)","journal-title":"Combinatorica"},{"key":"BF01788524_CR7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets, J. London Math. Soc.10, 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"key":"BF01788524_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Reading, MA: Addison-Wesley 1969"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788524.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788524\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:56:50Z","timestamp":1557410210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["BF01788524"],"URL":"https:\/\/doi.org\/10.1007\/bf01788524","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}