{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T05:25:12Z","timestamp":1741411512671,"version":"3.38.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00493-024-00131-1","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T06:02:07Z","timestamp":1734501727000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unfriendly Partition Conjecture Holds for Line\u00a0Graphs"],"prefix":"10.1007","volume":"45","author":[{"given":"Rafa\u0142","family":"Kalinowski","sequence":"first","affiliation":[]},{"given":"Monika","family":"Pil\u015bniak","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Stawiski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,18]]},"reference":[{"issue":"1","key":"131_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(90)90092-E","volume":"50","author":"R Aharoni","year":"1990","unstructured":"Aharoni, R., Milner, E., Prikry, K.: Unfriendly partitions of a graph. J. Combin. Theory Ser. B 50(1), 1\u201310 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"131_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00493-015-3261-1","volume":"37","author":"E Berger","year":"2017","unstructured":"Berger, E.: Unfriendly partitions for graphs not containing a subdivision of an infinite clique. Combinatorica 37(2), 157\u2013166 (2017)","journal-title":"Combinatorica"},{"key":"131_CR3","doi-asserted-by":"crossref","unstructured":"Bock, F., Kalinowski, R., Pardey, J., Pil\u015bniak, M., Rautenbach, D., Wo\u017aniak, M.: Majority Edge-Colorings of Graphs. Electron. J. Combin., 30:P1.42, (2023)","DOI":"10.37236\/11291"},{"issue":"2","key":"131_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"40","author":"OV Borodin","year":"1997","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Combin. Theory Ser. B 40(2), 184\u2013204 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"131_CR5","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00493-010-2590-3","volume":"30","author":"H Bruhn","year":"2010","unstructured":"Bruhn, H., Diestel, R., Georgakopoulos, A., Spr\u00fcssel, P.: Every rayless graph has an unfriendly partition. Combinatorica 30(5), 521\u2013532 (2010)","journal-title":"Combinatorica"},{"key":"131_CR6","volume-title":"Graph Theory","author":"R Diestel","year":"2016","unstructured":"Diestel, R.: Graph Theory, 5th edn. Springer-Verlag, Berlin (2016)","edition":"5"},{"key":"131_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF02942564","volume":"68","author":"R Halin","year":"1998","unstructured":"Halin, R.: The structure of rayless graphs. Abh. Math. Sem. Univ. Hamburg 68, 225\u2013253 (1998)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"2","key":"131_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.7151\/dmgt.2383","volume":"43","author":"J Haslegrave","year":"2023","unstructured":"Haslegrave, J.: Countable graphs are majority 3-choosable. Discuss. Math. Graph Theory 43(2), 499\u2013506 (2023)","journal-title":"Discuss. Math. Graph Theory"},{"key":"131_CR9","doi-asserted-by":"crossref","unstructured":"Kreuzer, S., Oum, S., Seymour, P., van der Zyphen, D., Wood, D.\u00a0R.: Majority colourings of digraphs. Electron. J. Combin., 24:P2.25, (2017)","DOI":"10.37236\/6410"},{"key":"131_CR10","first-page":"237","volume":"1","author":"L Lov\u00e1sz","year":"1966","unstructured":"Lov\u00e1sz, L.: On decomposition of graphs. Stud. Sci. Math. Hungar. 1, 237\u2013238 (1966)","journal-title":"Stud. Sci. Math. Hungar."},{"key":"131_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF01192782","volume":"40","author":"R Schmidt","year":"1983","unstructured":"Schmidt, R.: Ein ordungsbegriff f\u00fcr graphen ohne unendliche Wege mit Anwendung auf n-fach zusammenh\u00e4ngende Graphen. Arch. Math. 40, 283\u2013288 (1983)","journal-title":"Arch. Math."},{"key":"131_CR12","doi-asserted-by":"crossref","unstructured":"Shelah, S., Milner, E.: Graphs with no unfriendly partitions. in A. Baker, B. Bollob\u00e1s, A. Hajnal, (eds.), A tribute to Paul Erd\u0151s, Cambridge University Press, 373-384, 1990","DOI":"10.1017\/CBO9780511983917.031"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00131-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00131-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00131-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T13:39:31Z","timestamp":1741354771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00131-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00131-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2024,12,18]]},"assertion":[{"value":"31 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"3"}}