{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:12:55Z","timestamp":1648894375480},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00373-015-1607-5","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T10:14:24Z","timestamp":1438337664000},"page":"801-811","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Edge Criticality in Graph Domination"],"prefix":"10.1007","volume":"32","author":[{"given":"Jan H","family":"van Vuuren","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"1607_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(83)90085-7","volume":"47","author":"D Bauer","year":"1983","unstructured":"Bauer, D., Harary, F., Nieminen, J., Sujel, C.L.: Domination alteration sets in graphs. Discret. Math. 47, 153\u2013161 (1983)","journal-title":"Discret. Math."},{"key":"1607_CR2","volume-title":"Theory of Graphs and its Applications","author":"C Berge","year":"1962","unstructured":"Berge, C.: Theory of Graphs and its Applications. Methuen, London (1962)"},{"key":"1607_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","volume":"86","author":"JF Fink","year":"1990","unstructured":"Fink, J.F., Jacobson, M.S., Kinch, L.F., Roberts, J.: The bondage number of a graph. Discret. Math. 86, 47\u201357 (1990)","journal-title":"Discret. Math."},{"key":"1607_CR4","first-page":"31","volume":"22","author":"BL Hartnell","year":"1998","unstructured":"Hartnell, B.L., Jorgensen, L.K., Vestergaard, P.D., Whitehead, C.A.: Edge-stability of the $$k$$ k -domination number of trees. Bull. Inst. Comb. Appl. 22, 31\u201340 (1998)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"1607_CR5","first-page":"65","volume":"33","author":"BL Hartnell","year":"1992","unstructured":"Hartnell, B.L., Rall, D.F.: A characterisation of trees in which no edge is essential to the domination number. Ars Comb. 33, 65\u201376 (1992)","journal-title":"Ars Comb."},{"key":"1607_CR6","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1997","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1997)"},{"key":"1607_CR7","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1997","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1997)"},{"issue":"2","key":"1607_CR8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.jco.2011.11.001","volume":"28","author":"F-T Hu","year":"2012","unstructured":"Hu, F.-T., Xu, J.-M.: On complexity of bondage and reinforcement. J. Complex. 28(2), 192\u2013201 (2012)","journal-title":"J. Complex."},{"key":"1607_CR9","first-page":"206","volume":"38","author":"O Ore","year":"1962","unstructured":"Ore, O.: Theory of graphs. Am. Math. Soc. Trans. 38, 206\u2013212 (1962)","journal-title":"Am. Math. Soc. Trans."},{"key":"1607_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0012-365X(96)00007-6","volume":"171","author":"U Teschner","year":"1997","unstructured":"Teschner, U.: New results about the bondage number of a graph. Discret. Math. 171, 249\u2013259 (1997)","journal-title":"Discret. Math."},{"key":"1607_CR11","first-page":"70","volume":"2","author":"HB Walikar","year":"1979","unstructured":"Walikar, H.B., Acharya, B.D.: Domination critical graphs. Natl. Acad. Sci. Lett. 2, 70\u201372 (1979)","journal-title":"Natl. Acad. Sci. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1607-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1607-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1607-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:41Z","timestamp":1559041181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1607-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["1607"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1607-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,1]]}}}