{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:37:45Z","timestamp":1648895865637},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"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":["Combinatorica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00493-016-3436-4","type":"journal-article","created":{"date-parts":[[2016,5,9]],"date-time":"2016-05-09T21:44:10Z","timestamp":1462830250000},"page":"785-793","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Infinitely connected subgraphs in graphs of uncountable chromatic number"],"prefix":"10.1007","volume":"37","author":[{"given":"Carsten","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"3436_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s and A. Hajnal: On chromatic number of graphs and set systems, Acta Math. Acad. Sci. Hungar\n17 (1966), 61\u201399.","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"3436_CR2","first-page":"219","volume":"14","author":"G. Fodor","year":"1951","unstructured":"G. Fodor: Proof of a conjecture of P. Erd\u0151s, Acta Sci. Math (Szeged).\n14 (1951), 219\u2013227.","journal-title":"Acta Sci. Math (Szeged)."},{"key":"3436_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02579156","volume":"4","author":"A. Hajnal","year":"1984","unstructured":"A. Hajnal and P. Komj\u00e1th: What must and what need not be contained in a graph of uncountable chromatic number, Combinatorica\n4 (1984), 47\u201352.","journal-title":"Combinatorica"},{"key":"3436_CR4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S. L. Hakimi","year":"1965","unstructured":"S. L. Hakimi: On the degree of the vertices of a directed graph, J. Franklin Institute\n279 (1965), 290\u2013308.","journal-title":"J. Franklin Institute"},{"key":"3436_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02782936","volume":"56","author":"P. Komj\u00e1th","year":"1986","unstructured":"P. Komj\u00e1th: Connectivity and chromatic number of infinite graphs, Israel J. Math\n56 (1986), 257\u2013266.","journal-title":"Israel J. Math"},{"key":"3436_CR6","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1016\/j.disc.2010.11.004","volume":"311","author":"P. Komj\u00e1th","year":"2011","unstructured":"P. Komj\u00e1th: The chromatic number of infinite graphs-a survey, Discrete Math\n311 (2011), 1448\u20131450.","journal-title":"Discrete Math"},{"key":"3436_CR7","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s11856-012-0176-z","volume":"196","author":"P. Komj\u00e1th","year":"2013","unstructured":"P. Komj\u00e1th: A note on chromatic number and connectivity of infinite graphs, Israel J. Math\n196 (2013), 499\u2013506.","journal-title":"Israel J. Math"},{"key":"3436_CR8","unstructured":"P. Komj\u00e1th: The list-chromatic number of infinite graphs, manuscript."},{"key":"3436_CR9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jctb.2015.05.004","volume":"115","author":"D. T. Soukup","year":"2015","unstructured":"D. T. Soukup: Trees, ladders, and graphs, J. Combin. Theory Ser. B\n115 (2015), 96\u2013116.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3436_CR10","first-page":"129","volume-title":"Further Selected Topics in Graph Theory","author":"C. Thomassen","year":"1983","unstructured":"C. Thomassen: Infinite graphs, in: Further Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson, eds.) Academic Press, London (1983) 129\u2013160."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3436-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3436-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3436-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3436-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:52Z","timestamp":1559079172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3436-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3436"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3436-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}