{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T09:11:27Z","timestamp":1717751487876},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,19]],"date-time":"2015-02-19T00:00:00Z","timestamp":1424304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00373-015-1537-2","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T07:58:39Z","timestamp":1424246319000},"page":"257-269","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Connected Colourings of Complete Graphs and Hypergraphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Imre","family":"Leader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ta Sheng","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,19]]},"reference":[{"issue":"3","key":"1537_CR1","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1112\/plms\/83.3.532","volume":"83","author":"RC Baker","year":"2001","unstructured":"Baker, R.C., Harman, G., Pintz, J.: The difference between consecutive primes. Proc Lond Math Soc 83(3), 532\u2013562 (2001)","journal-title":"Proc Lond Math Soc"},{"issue":"4","key":"1537_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00493-007-2224-6","volume":"27","author":"RN Ball","year":"2007","unstructured":"Ball, R.N., Pultr, A., Vojt\u011bchovsk\u00fd, P.: Coloured graphs without colorful cycles. Combinatorica 27(4), 407\u2013427 (2007)","journal-title":"Combinatorica"},{"key":"1537_CR3","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.disc.2005.12.020","volume":"306","author":"K Diao","year":"2006","unstructured":"Diao, K., Liu, G., Rautenbach, D., Zhao, P.: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discrete Math. 306, 670\u2013672 (2006)","journal-title":"Discrete Math."},{"key":"1537_CR4","first-page":"381","volume-title":"Hypergraphs, handbook of combinatorics","author":"P Duchet","year":"1995","unstructured":"Duchet, P.: Hypergraphs, handbook of combinatorics, pp. 381\u2013432. MIT Press, Cambridge (1995)"},{"key":"1537_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-010-0891-3","volume":"26","author":"S Fujita","year":"2010","unstructured":"Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of Ramsey theory: a survey. Graphs Combin. 26, 1\u201330 (2010)","journal-title":"Graphs Combin."},{"key":"1537_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar. 18, 25\u201366 (1967). (in German)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"14","key":"1537_CR7","doi-asserted-by":"crossref","first-page":"3069","DOI":"10.1016\/j.dam.2009.06.026","volume":"157","author":"V Gurvich","year":"2009","unstructured":"Gurvich, V.: Decomposing complete edge-chromatic graphs and hypergraphs. Revisit Discret Appl Math. 157(14), 3069\u20133085 (2009)","journal-title":"Revisit Discret Appl Math."},{"issue":"3","key":"1537_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/jgt.20452","volume":"64","author":"A Gy\u00e1rf\u00e1s","year":"2010","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N., Seb\u0151, A., Selkow, S.: Ramsey-type results for Gallai colorings. J. Graph Theory 64(3), 233\u2013243 (2010)","journal-title":"J. Graph Theory"},{"key":"1537_CR9","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1016\/j.disc.2009.10.013","volume":"310","author":"A Gy\u00e1rf\u00e1s","year":"2010","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: Gallai colorings of non-complete graphs. Discrete Math. 310, 977\u2013980 (2010)","journal-title":"Discrete Math."},{"issue":"3","key":"1537_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/jgt.20001","volume":"46","author":"A Gy\u00e1rf\u00e1s","year":"2004","unstructured":"Gy\u00e1rf\u00e1s, A., Simonyi, G.: Edge colorings of complete graphs without tricolored triangles. J. Graph Theory 46(3), 211\u2013216 (2004)","journal-title":"J. Graph Theory"},{"key":"1537_CR11","first-page":"1","volume":"2","author":"G Hoheisel","year":"1930","unstructured":"Hoheisel, G.: Primzahlprobleme in der analysis. Sitz Preuss. Akad. Wiss 2, 1\u201313 (1930)","journal-title":"Sitz Preuss. Akad. Wiss"},{"key":"1537_CR12","first-page":"608","volume":"167\u2013168","author":"P Johnson","year":"1997","unstructured":"Johnson, P.: Research problems: Problem 277 (BCC15.7). Edge-colourings of complete graphs. Discrete Math. 167\u2013168, 608 (1997)","journal-title":"Discrete Math."},{"key":"1537_CR13","first-page":"25","volume-title":"Perfect Graphs","author":"F Maffray","year":"2001","unstructured":"Maffray, F., Preissmann, M.: A translation of T. Gallai\u2019s paper: \u201cTransitiv orientierbare Graphen\u201d. In: Ramirez-Alfonsin, J.L., Reed, B.A. (eds.) Perfect Graphs, pp. 25\u201366. Wiley, New York (2001)"},{"key":"1537_CR14","unstructured":"S. Thomass\u00e9, personal communication (2013)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1537-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1537-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1537-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T08:06:47Z","timestamp":1717747607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1537-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,19]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1537"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1537-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,19]]}}}