{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:22:08Z","timestamp":1777605728974,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,5,15]],"date-time":"2008-05-15T00:00:00Z","timestamp":1210809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00454-008-9081-y","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T14:26:26Z","timestamp":1210775186000},"page":"444-468","source":"Crossref","is-referenced-by-count":11,"title":["Cores of Simplicial Complexes"],"prefix":"10.1007","volume":"40","author":[{"given":"Mario","family":"Marietti","sequence":"first","affiliation":[]},{"given":"Damiano","family":"Testa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"9081_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","volume":"23","author":"R.B. Allan","year":"1978","unstructured":"Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math. 23, 73\u201376 (1978)","journal-title":"Discrete Math."},{"key":"9081_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(84)90145-6","volume":"49","author":"R.B. Allan","year":"1984","unstructured":"Allan, R.B., Laskar, R., Hedetniemi, S.: A note on total domination. Discrete Math. 49, 7\u201313 (1984)","journal-title":"Discrete Math."},{"key":"9081_CR3","series-title":"Congressus Numerantium","first-page":"321","volume-title":"Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing","author":"T. Beyer","year":"1977","unstructured":"Beyer, T., Hedetniemi, S., Mitchell, S., Proskurowski, A.: Independent domination in trees. In: Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, LA, 1977. Congressus Numerantium, vol.\u00a0XIX, pp. 321\u2013328. Utilitas Math., Winnipeg (1977)"},{"key":"9081_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol.\u00a0184. Springer, Berlin (1998)"},{"issue":"3","key":"9081_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","volume":"3","author":"B. Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B., Cockayne, E.J.: Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3), 241\u2013249 (1979)","journal-title":"J. Graph Theory"},{"key":"9081_CR6","unstructured":"Bousquet-M\u00e9lou, M., Linusson, S., Nevo, E.: On the independence complex of square grids. arXiv:math\/0701890v2 [math.CO]"},{"key":"9081_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"E.J. Cockayne","year":"1975","unstructured":"Cockayne, E.J., Goodman, S.E., Hedetniemi, S.T.: A linear algorithm for the domination number of a tree. Inf. Process. Lett. 4, 41\u201344 (1975)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9081_CR8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(79)90053-9","volume":"18","author":"S. Mitchell","year":"1979","unstructured":"Mitchell, S., Cockayne, E., Hedetniemi, S.: Linear algorithms on recursive representations of trees. J.\u00a0Comput. Syst. Sci. 18(1), 76\u201385 (1979)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9081_CR9","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9372-6","volume-title":"A Course in Simple-Homotopy Theory","author":"M.M. Cohen","year":"1973","unstructured":"Cohen, M.M.: A Course in Simple-Homotopy Theory. Graduate Texts in Mathematics, vol.\u00a010. Springer, New York (1973)"},{"key":"9081_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Berlin (1997)"},{"key":"9081_CR11","unstructured":"Engstr\u00f6m, A.: Complexes of directed trees and independence complexes. arXiv:math\/0508148v1 [math.CO]"},{"issue":"6","key":"9081_CR12","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.ejc.2005.04.010","volume":"27","author":"R. Ehrenborg","year":"2006","unstructured":"Ehrenborg, R., Hetyei, G.: The topology of the independence complex. Eur. J. Comb. 27(6), 906\u2013923 (2006)","journal-title":"Eur. J. Comb."},{"key":"9081_CR13","first-page":"1179","volume-title":"Graph Theory, Combinatorics, and Algorithms","author":"P. Erd\u0151s","year":"1995","unstructured":"Erd\u0151s, P., Tuza, Z.: Vertex coverings of the edge set in a connected graph. In: Graph Theory, Combinatorics, and Algorithms, Kalamazoo, MI, 1992, vols. 1, 2, pp. 1179\u20131187. Wiley-Interscience, New York (1995)"},{"key":"9081_CR14","series-title":"Congressus Numerantium","first-page":"467","volume-title":"Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing","author":"S. Goodman","year":"1975","unstructured":"Goodman, S., Hedetniemi, S., Mitchell, S.: Some linear algorithms on trees. In Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic Univ., Boca Raton, FL, 1975. Congressus Numerantium, vol.\u00a0XIV, pp.\u00a0467\u2013483. Utilitas Math., Winnipeg (1975)"},{"issue":"1","key":"9081_CR15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0205009","volume":"5","author":"S. Goodman","year":"1976","unstructured":"Goodman, S., Hedetniemi, S., Tarjan, R.E.: b-matchings in trees. SIAM J. Comput. 5(1), 104\u2013108 (1976)","journal-title":"SIAM J. Comput."},{"key":"9081_CR16","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics, vol.\u00a0208. Marcel Dekker, New York (1998)"},{"issue":"1","key":"9081_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.37236\/1085","volume":"13","author":"M.A. Henning","year":"2006","unstructured":"Henning, M.A., Yeo, A.: Total domination and matching numbers in claw-free graphs. Electron. J. Comb. 13(1), 59 (2006)","journal-title":"Electron. J. Comb."},{"key":"9081_CR18","unstructured":"Jonsson, J.: Certain homology cycles of the independence complex of grid graphs. Preprint"},{"key":"9081_CR19","unstructured":"Klivans, C.: Threshold graphs, shifted complexes, and graphical complexes. arXiv:math\/0703114v1 [math.CO]"},{"issue":"1","key":"9081_CR20","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.1999.2984","volume":"88","author":"D. Kozlov","year":"1999","unstructured":"Kozlov, D.: Complexes of directed trees. J. Comb. Theory Ser. A 88(1), 112\u2013122 (1999)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"9081_CR21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s00454-004-2906-4","volume":"32","author":"D. Kozlov","year":"2004","unstructured":"Kozlov, D.: Directed trees in a string, real polynomials with triple roots, and chain mails. Discrete Comput. Geom. 32(3), 373\u2013382 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"9081_CR22","series-title":"Lecture Note in Mathematics","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BFb0092276","volume-title":"Combinatorics and Graph Theory","author":"R. Laskar","year":"1981","unstructured":"Laskar, R., Walikar, H.B.: On domination related concepts in graph theory. In: Combinatorics and Graph Theory. Lecture Note in Mathematics, vol.\u00a0885, pp. 308\u2013320. Springer, Berlin (1981)"},{"key":"9081_CR23","series-title":"Graduate Texts in Mathematics","volume-title":"Combinatorial Commutative Algebra","author":"E. Miller","year":"2005","unstructured":"Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol.\u00a0227. Springer, New York (2005)"},{"key":"9081_CR24","volume-title":"Elements of Algebraic Topology","author":"J.R. Munkres","year":"1984","unstructured":"Munkres, J.R.: Elements of Algebraic Topology. Perseus Books, London (1984)"},{"issue":"3","key":"9081_CR25","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-T","volume":"31","author":"C.M. Mynhardt","year":"1999","unstructured":"Mynhardt, C.M.: Vertices contained in every minimum dominating set of a tree. J. Graph Theory 31(3), 163\u2013177 (1999)","journal-title":"J. Graph Theory"},{"key":"9081_CR26","series-title":"Progress in Mathematics","volume-title":"Combinatorics and Commutative Algebra","author":"R. Stanley","year":"1996","unstructured":"Stanley, R.: Combinatorics and Commutative Algebra, 2nd edn. Progress in Mathematics, vol.\u00a041. Birkh\u00e4user, Basel (1996)","edition":"2"},{"key":"9081_CR27","unstructured":"Wassmer, A.: A dual independence complex. PhD thesis, Technische Universit\u00e4t Berlin (2005)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9081-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-008-9081-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9081-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T17:25:45Z","timestamp":1588699545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-008-9081-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,15]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s00454-008-9081-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,15]]}}}