{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T07:30:43Z","timestamp":1746775843602,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00454-024-00630-4","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T15:02:58Z","timestamp":1708614178000},"page":"500-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Total Cut Complexes of Graphs"],"prefix":"10.1007","volume":"73","author":[{"given":"Margaret","family":"Bayer","sequence":"first","affiliation":[]},{"given":"Mark","family":"Denker","sequence":"additional","affiliation":[]},{"given":"Marija Jeli\u0107","family":"Milutinovi\u0107","sequence":"additional","affiliation":[]},{"given":"Rowan","family":"Rowlands","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1583-4740","authenticated-orcid":false,"given":"Sheila","family":"Sundaram","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"630_CR1","unstructured":"Bayer, M., Denker, M., Milutinovi\u0107, M.J., Rowlands, R., Sundaram, S. Xue, L.: Topology of cut complexes of graphs. SIAM J. Discrete Math. (to appear), arXiv:2304.13675"},{"key":"630_CR2","first-page":"1819","volume-title":"Handbook of Combinatorics","author":"A Bj\u00f6rner","year":"1995","unstructured":"Bj\u00f6rner, A.: Topological methods. In: Handbook of Combinatorics, vol. 1\u20132, pp. 1819\u20131872. Elsevier Science BV, Amsterdam (1995)"},{"issue":"3","key":"630_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0001-8708(84)90021-5","volume":"52","author":"A Bj\u00f6rner","year":"1984","unstructured":"Bj\u00f6rner, A.: Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings. Adv. Math. 52(3), 173\u2013212 (1984)","journal-title":"Adv. Math."},{"issue":"1","key":"630_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1090\/S0002-9947-1983-0690055-6","volume":"277","author":"A Bj\u00f6rner","year":"1983","unstructured":"Bj\u00f6rner, A., Wachs, M.: On lexicographically shellable posets. Trans. Am. Math. Soc. 277(1), 323\u2013341 (1983)","journal-title":"Trans. Am. Math. Soc."},{"issue":"10","key":"630_CR5","doi-asserted-by":"publisher","first-page":"3945","DOI":"10.1090\/S0002-9947-97-01838-2","volume":"349","author":"A Bj\u00f6rner","year":"1997","unstructured":"Bj\u00f6rner, A., Wachs, M.L.: Shellable nonpure complexes and posets II. Trans. Am. Math. Soc. 349(10), 3945\u20133975 (1997)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"630_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0022-4049(97)00051-0","volume":"122","author":"W Bruns","year":"1997","unstructured":"Bruns, W., Herzog, J.: Semigroup rings and simplicial complexes. J. Pure Appl. Algebra 122(3), 185\u2013208 (1997)","journal-title":"J. Pure Appl. Algebra"},{"key":"630_CR7","first-page":"1","volume":"36","author":"P Deshpande","year":"2021","unstructured":"Deshpande, P., Singh, A.: Higher independence complexes of graphs and their homotopy type. J. Ramanujan Math. Soc. 36, 1 (2021)","journal-title":"J. Ramanujan Math. Soc."},{"issue":"3","key":"630_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0022-4049(97)00097-2","volume":"130","author":"JA Eagon","year":"1998","unstructured":"Eagon, J.A., Reiner, V.: Resolutions of Stanley\u2013Reisner rings and Alexander duality. J. Pure Appl. Algebra 130(3), 265\u2013275 (1998)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"630_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/aima.1997.1650","volume":"134","author":"R Forman","year":"1998","unstructured":"Forman, R.: Morse theory for cell complexes. Adv. Math. 134(1), 90\u2013145 (1998)","journal-title":"Adv. Math."},{"key":"630_CR10","first-page":"57","volume-title":"Topics in Algebra, Part 2 (Warsaw, 1988) Banach Center Publication","author":"R Fr\u00f6berg","year":"1990","unstructured":"Fr\u00f6berg, R.: On Stanley-Reisner rings. In: Topics in Algebra, Part 2 (Warsaw, 1988) Banach Center Publication, vol. 26, pp. 57\u201370. PWN, Warsaw (1990)"},{"key":"630_CR11","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980). (ISBN 0-12-289260-7)"},{"key":"630_CR12","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002). (ISBN 0-521-79160-X; 0-521-79540-0)"},{"key":"630_CR13","doi-asserted-by":"crossref","unstructured":"Milutinovi\u0107, M.J., Jenne, H., McDonough, A., Vega, J.: Matching complexes of trees and applications of the matching tree algorithm. Ann. Comb. 26(4), 1041\u20131075 (2022)","DOI":"10.1007\/s00026-022-00605-3"},{"key":"630_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75859-4","volume-title":"Simplicial Complexes of Graphs. Lecture Notes in Mathematics","author":"J Jonsson","year":"2008","unstructured":"Jonsson, J.: Simplicial Complexes of Graphs. Lecture Notes in Mathematics, vol. 1928. Springer, Berlin (2008)"},{"key":"630_CR15","unstructured":"Kim, M., Lew, A.: Complexes of graphs with bounded independence number. S\u00e9m. Lothar. Comb. 84B, Art. 39, 12 (2020)"},{"key":"630_CR16","volume-title":"Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics","author":"D Kozlov","year":"2008","unstructured":"Kozlov, D.: Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics, vol. 21. Springer, Berlin (2008)"},{"key":"630_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7940-7","volume-title":"Introduction to Topological Manifolds. Graduate Texts in Mathematics","author":"John M Lee","year":"2011","unstructured":"Lee, John M.: Introduction to Topological Manifolds. Graduate Texts in Mathematics, vol. 202, 2nd edn. Springer, New York (2011)","edition":"2"},{"issue":"3","key":"630_CR18","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S0895480100366968","volume":"16","author":"S Linusson","year":"2003","unstructured":"Linusson, S., Shareshian, J.: Complexes of $$t$$-colorable graphs. SIAM J. Discrete Math. 16(3), 371\u2013389 (2003). https:\/\/doi.org\/10.1137\/S0895480100366968. (ISSN 0895-4801)","journal-title":"SIAM J. Discrete Math."},{"key":"630_CR19","unstructured":"Matou\u0161ek, J.: Using the Borsuk-Ulam theorem. Universitext. Springer, Berlin (2003). Lectures on topological methods in combinatorics and geometry, Written in cooperation with Anders Bj\u00f6rner and G\u00fcnter M. Ziegler"},{"key":"630_CR20","doi-asserted-by":"publisher","unstructured":"Provan, J.S., Billera, L.J.: Decompositions of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res. 5(4), 576\u2013594 (1980). https:\/\/doi.org\/10.1287\/moor.5.4.576. (ISSN 0364-765X)","DOI":"10.1287\/moor.5.4.576"},{"key":"630_CR21","volume-title":"Combinatorics and Commutative Algebra. Progress in Mathematics","author":"RP Stanley","year":"1996","unstructured":"Stanley, R.P.: Combinatorics and Commutative Algebra. Progress in Mathematics, vol. 41, 2nd edn. Birkh\u00e4user, Boston (1996)","edition":"2"},{"key":"630_CR22","doi-asserted-by":"crossref","unstructured":"Viro, O.Y., Ivanov, O.A., Netsvetaev, N.Y., Kharlamov, V.M.: Elementary Topology. American Mathematical Society, Providence, RI (2008)","DOI":"10.1090\/mbk\/054"},{"key":"630_CR23","first-page":"497","volume-title":"Geometric Combinatorics. IAS\/Park City Mathematical Series","author":"ML Wachs","year":"2007","unstructured":"Wachs, M.L.: Poset topology: tools and applications. In: Geometric Combinatorics. IAS\/Park City Mathematical Series, vol. 13, pp. 497\u2013615. American Mathematical Society, Providence (2007)"},{"key":"630_CR24","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall Inc, Upper Saddle River (1996)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00630-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-024-00630-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00630-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T23:52:51Z","timestamp":1739836371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-024-00630-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s00454-024-00630-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"6 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}