{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:47:07Z","timestamp":1725756427731},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_15","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"165-176","source":"Crossref","is-referenced-by-count":1,"title":["Linear Separation of Total Dominating Sets in Graphs"],"prefix":"10.1007","author":[{"given":"Nina","family":"Chiarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Benzaken, C., Hammer, P.L.: Linear separation of dominating sets in graphs. In: Bollob\u00e1s, B. (ed.) Advances in Graph Theory, Annals of Discrete Mathematics, vol.\u00a03, pp. 1\u201310. North-Holland (1978)","DOI":"10.1016\/S0167-5060(08)70492-8"},{"key":"15_CR2","unstructured":"Berge, C.: Hypergraphs. North-Holland (1989)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-59071-4_38","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Brandst\u00e4dt","year":"1995","unstructured":"Brandst\u00e4dt, A., Chepoi, V.D., Dragan, F.F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol.\u00a0903, pp. 65\u201380. Springer, Heidelberg (1995)"},{"key":"15_CR4","first-page":"370","volume":"49","author":"C.K. Chow","year":"1961","unstructured":"Chow, C.K.: Boolean functions realizable with single threshold devices. Proceedings of the IRE\u00a049, 370\u2013371 (1961)","journal-title":"Proceedings of the IRE"},{"key":"15_CR5","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume-title":"Studies in Integer Programming (Proc. Worksh. Bonn 1975)","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. In: Hammer, P.L., Johnson, E.L., Korte, B.H., et al. (eds.) Studies in Integer Programming (Proc. Worksh. Bonn 1975). Annals of Discrete Mathematics, vol.\u00a01, pp. 145\u2013162. North-Holland, Amsterdam (1975)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0012-365X(90)90357-N","volume":"86","author":"D.G. Corneil","year":"1990","unstructured":"Corneil, D.G., Stewart, L.: Dominating sets in perfect graphs. Discrete Math.\u00a086, 145\u2013164 (1990)","journal-title":"Discrete Math."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Crama, Y., Hammer, P.L.: Boolean functions: Theory, Algorithms, and Applications. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511852008"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Elgot, C.C.: Truth functions realizable by single threshold organs. In: IEEE Symposium on Switching Circuit Theory and Logical Design, pp. 225\u2013245 (1961)","DOI":"10.1109\/FOCS.1961.39"},{"key":"15_CR9","unstructured":"Gagarin, A.V., Metel\u2019ski\u012d, Y.M.: Characterization of (1,2)-polar graphs (in Russian) Vestsi Nats. Akad. Navuk Belarusi Ser. Fiz.-Mat. Navuk 3, 107\u2013112 (1999)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Ann. of Discrete Math., vol.\u00a057. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics. Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"M.A. Henning","year":"2009","unstructured":"Henning, M.A.: Recent results on total domination in graphs: A survey. Discrete Math.\u00a0309, 32\u201363 (2009)","journal-title":"Discrete Math."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer (2013)","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","volume":"99","author":"D. Kratsch","year":"2000","unstructured":"Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discrete Applied Math.\u00a099, 111\u2013123 (2000)","journal-title":"Discrete Applied Math."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-34611-8_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V.E. Levit","year":"2012","unstructured":"Levit, V.E., Milani\u010d, M., Tankus, D.: On the recognition of k-equistable graphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 286\u2013296. Springer, Heidelberg (2012)"},{"key":"15_CR17","series-title":"Ann. of Discrete Math","volume-title":"Threshold graphs and related topics","author":"N.V.R. Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold graphs and related topics. Ann. of Discrete Math, vol.\u00a056. North-Holland Publishing Co., Amsterdam (1995)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10479-010-0720-3","volume":"188","author":"M. Milani\u010d","year":"2011","unstructured":"Milani\u010d, M., Orlin, J., Rudolf, G.: Complexity results for equistable graphs and related classes. Ann. Oper. Res.\u00a0188, 359\u2013370 (2011)","journal-title":"Ann. Oper. Res."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(90)90286-Q","volume":"29","author":"C. Payan","year":"1980","unstructured":"Payan, C.: A class of threshold and domishold graphs: equistable and equidominating graphs. Discrete Math.\u00a029, 47\u201352 (1980)","journal-title":"Discrete Math."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90040-X","volume":"12","author":"U.N. Peled","year":"1985","unstructured":"Peled, U.N., Simeone, B.: Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Applied Math.\u00a012, 57\u201369 (1985)","journal-title":"Discrete Applied Math."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.tcs.2005.10.049","volume":"352","author":"I.E. Zverovich","year":"2006","unstructured":"Zverovich, I.E., Zverovich, O.I.: Independent domination in hereditary classes. Theoret. Comput. Sci.\u00a0352, 215\u2013225 (2006)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T11:55:02Z","timestamp":1688644502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}