{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:02:49Z","timestamp":1648508569692},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:00:00Z","timestamp":1591920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Lechuga and Murillo showed that a non-oriented, simple, connected, finite graph <jats:italic>G<\/jats:italic> is <jats:italic>k<\/jats:italic>-colourable if and only if a certain pure Sullivan algebra associated to <jats:italic>G<\/jats:italic> and <jats:italic>k<\/jats:italic> is not elliptic. In this paper, we extend this result to simplicial complexes by means of several notions of colourings of these objects.<\/jats:p>","DOI":"10.1007\/s00200-020-00440-0","type":"journal-article","created":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T16:02:47Z","timestamp":1591977767000},"page":"153-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Colouring simplicial complexes via the Lechuga\u2013Murillo\u2019s model"],"prefix":"10.1007","volume":"33","author":[{"given":"David","family":"M\u00e9ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"key":"440_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0","volume-title":"Hypergraph Theory, Mathematical Engineering. An Introduction","author":"A Bretto","year":"2013","unstructured":"Bretto, A.: Hypergraph Theory, Mathematical Engineering. An Introduction. Springer, Cham (2013)"},{"key":"440_CR2","doi-asserted-by":"crossref","unstructured":"Costoya, C., M\u00e9ndez, D., Viruel, A.: Homotopically rigid Sullivan algebras and their applications, An Alpine Bouquet of Algebraic Topology, Contemporary Mathematics, Volume 708, American Mathematical Society, Providence, RI, pp.\u00a0103\u2013121 (2018)","DOI":"10.1090\/conm\/708\/14270"},{"key":"440_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s13348-019-00265-2","author":"C Costoya","year":"2019","unstructured":"Costoya, C., M\u00e9ndez, D., Viruel, A.: Realisability problem in arrow categories. Collect. Math. (2019). https:\/\/doi.org\/10.1007\/s13348-019-00265-2","journal-title":"Collect. Math."},{"issue":"1","key":"440_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s11511-014-0115-4","volume":"213","author":"C Costoya","year":"2014","unstructured":"Costoya, C., Viruel, A.: Every finite group is the group of self-homotopy equivalences of an elliptic space. Acta Math. 213(1), 49\u201362 (2014)","journal-title":"Acta Math."},{"issue":"3","key":"440_CR5","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1093\/qmath\/hat052","volume":"65","author":"C Costoya","year":"2014","unstructured":"Costoya, C., Viruel, A.: Faithful actions on commutative differential graded algebras and the group isomorphism problem. Q. J. Math. 65(3), 857\u2013867 (2014)","journal-title":"Q. J. Math."},{"issue":"1\u20132","key":"440_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00200-014-0249-9","volume":"26","author":"C Costoya","year":"2015","unstructured":"Costoya, C., Viruel, A.: Rational homotopy theory for computing colorability of simplicial complexes. Appl. Algebra Eng. Commun. Comput. 26(1\u20132), 207\u2013212 (2015)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"440_CR7","doi-asserted-by":"crossref","unstructured":"Cowling, P.: The total graph of a hypergraph, Discrete Math. 167\/168 (1997), 215\u2013236. 15th British Combinatorial Conference (Stirling, 1995)","DOI":"10.1016\/S0012-365X(96)00230-0"},{"key":"440_CR8","unstructured":"Dobrinskaya, N., M\u00f8ller, J.M., Notbohm, D.: Vertex colorings of simplicial complexes, arXiv e-prints (2010), arXiv:1007.0710 [math.AT]"},{"key":"440_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0105-9","volume-title":"Rational Homotopy Theory, Graduate Texts in Mathematics","author":"Y F\u00e9lix","year":"2001","unstructured":"F\u00e9lix, Y., Halperin, S., Thomas, J.-C.: Rational Homotopy Theory, Graduate Texts in Mathematics, vol. 205. Springer, New York (2001)"},{"key":"440_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Incidence patterns of graphs and complexes, The Many Facets of Graph Theory (Proceedings Conferences, WesternMich. University, Kalamazoo, 1968), Springer, Berlin, 1969, pp.\u00a0115\u2013128","DOI":"10.1007\/BFb0060111"},{"key":"440_CR11","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of product graphs, second ed., In: Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, With a foreword by Peter Winkler (2011)","DOI":"10.1201\/b10959"},{"key":"440_CR12","volume-title":"Wilf, Algorithms and Complexity","author":"S Herbert","year":"2002","unstructured":"Herbert, S.: Wilf, Algorithms and Complexity, 2nd edn. A K Peters Ltd, Natick (2002)","edition":"2"},{"issue":"4","key":"440_CR13","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"440_CR14","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s00373-015-1578-6","volume":"32","author":"M Jesper","year":"2016","unstructured":"Jesper, M.: M\u00f8ller and Gesche Nord, Chromatic polynomials of simplicial complexes. Graphs Combin. 32(2), 745\u2013772 (2016)","journal-title":"Graphs Combin."},{"issue":"1","key":"440_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0040-9383(98)00059-7","volume":"39","author":"L Lechuga","year":"2000","unstructured":"Lechuga, L., Murillo, A.: Complexity in rational homotopy. Topology 39(1), 89\u201394 (2000)","journal-title":"Topology"},{"issue":"3","key":"440_CR16","doi-asserted-by":"publisher","first-page":"451","DOI":"10.36045\/bbms\/1102714569","volume":"8","author":"L Lechuga","year":"2001","unstructured":"Lechuga, L., Murillo, A.: The fundamental class of a rational space, the graph coloring problem and other classical decision problems. Bull. Belg. Math. Soc. Simon Stevin 8(3), 451\u2013467 (2001)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"1","key":"440_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven, D., Galil, Z.: NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4(1), 35\u201344 (1983)","journal-title":"J. Algorithms"},{"issue":"3","key":"440_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","volume":"78","author":"A S\u00e1nchez-Arroyo","year":"1989","unstructured":"S\u00e1nchez-Arroyo, A.: Determining the total colouring number is NP-hard. Discrete Math. 78(3), 315\u2013319 (1989)","journal-title":"Discrete Math."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00440-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00440-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00440-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T10:02:35Z","timestamp":1644660155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00440-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["440"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00440-0","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,12]]},"assertion":[{"value":"11 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}