{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T02:08:06Z","timestamp":1789870086143,"version":"4.0.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319445427","type":"print"},{"value":"9783319445434","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_18","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:49:58Z","timestamp":1470642598000},"page":"229-240","source":"Crossref","is-referenced-by-count":3,"title":["A Boundary Property for Upper Domination"],"prefix":"10.1007","author":[{"given":"Hassan","family":"AbouEisha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shahid","family":"Hussain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vadim","family":"Lozin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-319-12691-3_20","volume-title":"Combinatorial Optimization and Applications","author":"H AbouEisha","year":"2014","unstructured":"AbouEisha, H., Hussain, S., Lozin, V., Monnot, J., Ries, B.: A dichotomy for upper domination in monogenic classes. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 258\u2013267. Springer, Heidelberg (2014)"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(03)00387-1","volume":"132","author":"VE Alekseev","year":"2003","unstructured":"Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Appl. Math. 132, 17\u201326 (2003)","journal-title":"Discrete Appl. Math."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2004.04.010","volume":"285","author":"VE Alekseev","year":"2004","unstructured":"Alekseev, V.E., Korobitsyn, D.V., Lozin, V.V.: Boundary classes of graphs for the dominating set problem. Discrete Math. 285, 1\u20136 (2004)","journal-title":"Discrete Math."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.tcs.2007.09.013","volume":"389","author":"VE Alekseev","year":"2007","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389, 219\u2013236 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"18_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","volume":"27","author":"GA Cheston","year":"1990","unstructured":"Cheston, G.A., Fricke, G., Hedetniemi, S.T., Jacobs, D.P.: On the computational complexity of upper fractional domination. Discrete Appl. Math. 27(3), 195\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"18_CR6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","volume":"33","author":"EJ Cockayne","year":"1981","unstructured":"Cockayne, E.J., Favaron, O., Payan, C., Thomason, A.G.: Contributions to the theory of domination, independence and irredundance in graphs. Discrete Math. 33(3), 249\u2013258 (1981)","journal-title":"Discrete Math."},{"issue":"2","key":"18_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theor. Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theor. Comput. Syst."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique-width of a graph. Discrete Appl. Math. 101, 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/B978-0-12-386870-1.50030-7","volume-title":"Discrete Algorithms and Complexity","author":"EO Hare","year":"1987","unstructured":"Hare, E.O., Hedetniemi, S.T., Laskar, R.C., Peters, K., Wimer, T.: Linear-time computability of combinatorial problems on generalized-series-parallel graphs. In: Johnson, D.S., et al. (eds.) Discrete Algorithms and Complexity, pp. 437\u2013457. Academic Press, New York (1987)"},{"issue":"1\u20133","key":"18_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","volume":"86","author":"MS Jacobson","year":"1990","unstructured":"Jacobson, M.S., Peters, K.: Chordal graphs and upper irredundance, upper domination and independence. Discrete Math. 86(1\u20133), 59\u201369 (1990)","journal-title":"Discrete Math."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157, 2747\u20132761 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"18_CR12","first-page":"90","volume":"2","author":"DV Korobitsyn","year":"1990","unstructured":"Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskretnaya Matematika 2(3), 90\u201396 (1990). (in Russian, translation in Discrete Math. Appl. 2(2), 191\u2013199 (1992))","journal-title":"Diskretnaya Matematika"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"3545","DOI":"10.1016\/j.tcs.2011.03.001","volume":"412","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., Lozin, V.V., Malyshev, D.S., Tiskin, A.: Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412, 3545\u20133554 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s11083-012-9272-2","volume":"30","author":"N Korpelainen","year":"2013","unstructured":"Korpelainen, N., Lozin, V., Razgon, I.: Boundary properties of well-quasi-ordered sets of graphs. Order 30, 723\u2013735 (2013)","journal-title":"Order"},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0963548307008814","volume":"17","author":"VV Lozin","year":"2008","unstructured":"Lozin, V.V.: Boundary classes of planar graphs. Comb. Probab. Comput. 17, 287\u2013295 (2008)","journal-title":"Comb. Probab. Comput."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.disc.2013.01.008","volume":"313","author":"V Lozin","year":"2013","unstructured":"Lozin, V., Milani\u010d, M.: Critical properties of graphs of bounded clique-width. Discrete Math. 313, 1035\u20131044 (2013)","journal-title":"Discrete Math."},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.ipl.2013.01.022","volume":"113","author":"V Lozin","year":"2013","unstructured":"Lozin, V., Purcell, C.: Boundary properties of the satisfiability problems. Inf. Process. Lett. 113, 313\u2013317 (2013)","journal-title":"Inf. Process. Lett."},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: On the band-, tree- and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math. 18, 195\u2013206 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/jgt.21799","volume":"78","author":"V Lozin","year":"2015","unstructured":"Lozin, V., Zamaraev, V.: Boundary properties of factorial classes of graphs. J. Graph Theor. 78, 207\u2013218 (2015)","journal-title":"J. Graph Theor."},{"key":"18_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(92)90041-8","volume":"35","author":"OJ Murphy","year":"1992","unstructured":"Murphy, O.J.: Computing independent sets in graphs with large girth. Discrete Appl. Math. 35, 167\u2013170 (1992)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:11:13Z","timestamp":1498320673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}