{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:11:44Z","timestamp":1648851104660},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T00:00:00Z","timestamp":1347408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1219-2","type":"journal-article","created":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T18:13:03Z","timestamp":1347387183000},"page":"1689-1711","source":"Crossref","is-referenced-by-count":0,"title":["Stack Domination Density"],"prefix":"10.1007","volume":"29","author":[{"given":"Timothy","family":"Brauch","sequence":"first","affiliation":[]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Jobson","sequence":"additional","affiliation":[]},{"given":"D. Jacob","family":"Wildstrom","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,12]]},"reference":[{"key":"1219_CR1","doi-asserted-by":"crossref","unstructured":"Bayati, M., Gamarnik, D., Tetali, P.: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. In: STOC\u201910\u2014Proceedings of the 2010 ACM International Symposium on Theory of Computing, pp. 105\u2013114. ACM, New York (2010)","DOI":"10.1145\/1806689.1806706"},{"key":"1219_CR2","first-page":"97","volume":"38","author":"T.Y. Chang","year":"1994","unstructured":"Chang T.Y., Clark W.E., Hare E.O.: Domination numbers of complete grid graphs. I. Ars Combin. 38, 97\u2013111 (1994)","journal-title":"Ars Combin."},{"issue":"1\u20133","key":"1219_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0166-218X(97)00126-1","volume":"84","author":"D.C. Fisher","year":"1998","unstructured":"Fisher D.C., McKenna P.A., Boyer E.D.: Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski\u2019s graphs. Discrete Appl. Math. 84(1\u20133), 93\u2013105 (1998). doi: 10.1016\/S0166-218X(97)00126-1","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"1219_CR4","first-page":"657","volume":"37","author":"M.J.E. Golay","year":"1949","unstructured":"Golay M.J.E.: Notes on digital coding. Proceedings of the IRE 37(6), 657 (1949). doi: 10.1109\/JRPROC.1949.233620","journal-title":"Proceedings of the IRE"},{"key":"1219_CR5","first-page":"33","volume":"18","author":"M.S. Jacobson","year":"1984","unstructured":"Jacobson M.S., Kinch L.F.: On the domination number of products of graphs. I. Ars Combin. 18, 33\u201344 (1984)","journal-title":"Ars Combin."},{"issue":"1","key":"1219_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/jgt.3190100112","volume":"10","author":"M.S. Jacobson","year":"1986","unstructured":"Jacobson M.S., Kinch L.F.: On the domination of the products of graphs. II. Trees. J. Graph Theory 10(1), 97\u2013106 (1986). doi: 10.1002\/jgt.3190100112","journal-title":"J. Graph Theory"},{"issue":"17\u201318","key":"1219_CR7","doi-asserted-by":"crossref","first-page":"2221","DOI":"10.1016\/j.disc.2010.03.022","volume":"310","author":"E.L.C. King","year":"2010","unstructured":"King E.L.C., Pelsmajer M.J.: Dominating sets in plane triangulations. Discrete Math. 310(17\u201318), 2221\u20132230 (2010). doi: 10.1016\/j.disc.2010.03.022","journal-title":"Discrete Math."},{"issue":"1","key":"1219_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.26493\/1855-3974.200.fbe","volume":"4","author":"H. Liu","year":"2011","unstructured":"Liu H., Pelsmajer M.J.: Dominating sets in triangulations on surfaces. Ars Math. Contemp. 4(1), 177\u2013204 (2011)","journal-title":"Ars Math. Contemp."},{"key":"1219_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M. Molloy","year":"2002","unstructured":"Molloy M., Reed B.: Graph Colouring and the Probabilistic Method. Springer, Berlin (2002)"},{"key":"1219_CR10","unstructured":"Rubalcaba, R., Slater, P.J.: Efficient cartesian product layer domination. In: 22nd Cumberland Conference on Combinatorics, Graph Theory and Computing (2009)"},{"issue":"6 (144","key":"1219_CR11","first-page":"117","volume":"23","author":"V.G. Vizing","year":"1968","unstructured":"Vizing V.G.: Some unsolved problems in graph theory. Uspehi Mat. Nauk 23(6 (144), 117\u2013134 (1968)","journal-title":"Uspehi Mat. Nauk"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1219-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1219-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1219-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T18:24:08Z","timestamp":1562178248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1219-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1219"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1219-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,12]]}}}