{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:35Z","timestamp":1725897635480},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_18","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T11:12:12Z","timestamp":1344856332000},"page":"204-215","source":"Crossref","is-referenced-by-count":3,"title":["Ramsey Numbers for Line Graphs and Perfect Graphs"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Belmonte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Saei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math.\u00a0164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Ser., p. 327 (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.4153\/CMB-1975-005-0","volume":"18","author":"E.J. Cockayne","year":"1975","unstructured":"Cockayne, E.J., Lorimer, P.J.: On Ramsey graph numbers for stars and stripes. Canad. Math. Bull.\u00a018, 31\u201334 (1975)","journal-title":"Canad. Math. Bull."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Electronic edition. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Disc.\u00a0Math.\u00a057 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"18_CR7","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory, 2nd edn. Wiley (1990)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory. Addison-Wesley (1969)","DOI":"10.21236\/AD0705364"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/jgt.3190090208","volume":"9","author":"M.M. Matthews","year":"1985","unstructured":"Matthews, M.M.: Longest paths and cycles in K 1,3-free graphs. Journal of Graph Theory\u00a09, 269\u2013277 (1985)","journal-title":"Journal of Graph Theory"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Radziszowski, S.P.: Small Ramsey numbers. Electronic Journal of Combinatorics, Dynamic Surveys (2011)","DOI":"10.37236\/21"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. Series 2, vol.\u00a030, pp. 264\u2013286 (1930)","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Spencer, J.H.: Ten Lectures on the Probabilistic Method. SIAM (1994)","DOI":"10.1137\/1.9781611970074"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jctb.1993.1070","volume":"59","author":"R. Steinberg","year":"1993","unstructured":"Steinberg, R., Tovey, C.A.: Planar Ramsey numbers. J. Combinatorial Theory Series B\u00a059, 288\u2013296 (1993)","journal-title":"J. Combinatorial Theory Series B"},{"key":"18_CR14","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz.\u00a03, 25\u201330 (1964) (in Russian)","journal-title":"Diskret. Analiz."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1112\/blms\/1.2.187","volume":"1","author":"K. Walker","year":"1969","unstructured":"Walker, K.: The analog of Ramsey numbers for planar graphs. Bull. London Math. Soc.\u00a01, 187\u2013190 (1969)","journal-title":"Bull. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T10:35:18Z","timestamp":1594550118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}