{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:25:08Z","timestamp":1777893908184,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"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":[[2010,5]]},"DOI":"10.1007\/s00373-010-0918-9","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T05:08:58Z","timestamp":1267420138000},"page":"407-424","source":"Crossref","is-referenced-by-count":7,"title":["Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Christian","family":"L\u00f6wenstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"918_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon N., Spencer J.: The Probabilistic Method. Wiley, New York (1992)"},{"key":"918_CR2","first-page":"3","volume":"11","author":"V.I. Arnautov","year":"1974","unstructured":"Arnautov V.I.: Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices (Russian). Prikl. Mat. Programm. 11, 3\u20138 (1974)","journal-title":"Prikl. Mat. Programm."},{"key":"918_CR3","first-page":"101","volume":"21","author":"D.W. Bange","year":"1978","unstructured":"Bange D.W., Barkauskas A.E., Slater P.J.: A constructive characterization of trees with two disjoint minimum dominating sets. Congr. Numerantium 21, 101\u2013112 (1978)","journal-title":"Congr. Numerantium"},{"key":"918_CR4","first-page":"3","volume":"10","author":"M. Blank","year":"1973","unstructured":"Blank M.: An estimate of the external stability number of a graph without suspended vertices. Prikl. Math. Programm. 10, 3\u201311 (1973)","journal-title":"Prikl. Math. Programm."},{"key":"918_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(97)00014-0","volume":"78","author":"M.-S. Chang","year":"1997","unstructured":"Chang M.-S., Hsu C.-C.: On minimum intersection of two minimum dominating sets of interval graphs. Discrete Appl. Math. 78, 41\u201350 (1997)","journal-title":"Discrete Appl. Math."},{"key":"918_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"E.J. Cockayne","year":"1977","unstructured":"Cockayne E.J., Hedetniemi S.T.: Towards a theory of domination in graphs. Networks 7, 247\u2013261 (1977)","journal-title":"Networks"},{"key":"918_CR7","first-page":"247","volume":"73","author":"P. Dankelmann","year":"2004","unstructured":"Dankelmann P., Calkin N.J.: The domatic number of regular graphs. Ars Combin. 73, 247\u2013255 (2004)","journal-title":"Ars Combin."},{"key":"918_CR8","first-page":"149","volume":"72","author":"G.S. Domke","year":"2004","unstructured":"Domke G.S., Dunbar J.E., Markus L.R.: The inverse domination number of a graph. Ars Combin. 72, 149\u2013160 (2004)","journal-title":"Ars Combin."},{"key":"918_CR9","first-page":"220","volume":"3","author":"P. Eades","year":"1996","unstructured":"Eades P., Keil M., Manuel P.D., Miller M.: Two minimum dominating sets with minimum intersection in chordal graphs. Nord. J. Comput. 3, 220\u2013237 (1996)","journal-title":"Nord. J. Comput."},{"key":"918_CR10","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2003","unstructured":"Feige U., Halld\u00f3rsson M.M., Kortsarz G., Srinivasan A.: Approximating the domatic number. SIAM J. Comput. 32, 172\u2013195 (2003)","journal-title":"SIAM J. Comput."},{"key":"918_CR11","unstructured":"Frendrup, A., Henning, M.A., Randerath, B., Vestergaard, P.D.: On a conjecture about inverse domination in graphs. Ars Combin. (to appear)"},{"key":"918_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"918_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(90)90364-N","volume":"86","author":"D.L. Grinstead","year":"1990","unstructured":"Grinstead D.L., Slater P.J.: On minimum dominating sets with minimum intersection. Discrete Math. 86, 239\u2013254 (1990)","journal-title":"Discrete Math."},{"key":"918_CR14","volume-title":"Fundamentals of Domination in Graphs","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds): Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"918_CR15","volume-title":"Domination in Graphs: Advanced Topics","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"918_CR16","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R.C., Markus, L., Slater, P.J.: Disjoint dominating sets in graphs. In: Proceedings of the International Conference on Discrete Mathematics. Ramanujan Mathematics Society Lecture Notes Series, vol. 7, pp. 87\u2013100 (2008)"},{"key":"918_CR17","doi-asserted-by":"crossref","first-page":"6451","DOI":"10.1016\/j.disc.2009.06.017","volume":"309","author":"M.A. Henning","year":"2000","unstructured":"Henning M.A., L\u00f6wenstein C., Rautenbach D.: Remarks about disjoint dominating sets. Discrete Math. 309, 6451\u20136458 (2000)","journal-title":"Discrete Math."},{"key":"918_CR18","first-page":"473","volume":"14","author":"V.R. Kulli","year":"1991","unstructured":"Kulli V.R., Sigarkanti S.C.: Inverse domination in graphs. Nat. Acad. Sci. Lett. 14, 473\u2013475 (1991)","journal-title":"Nat. Acad. Sci. Lett."},{"key":"918_CR19","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"W. McCuaig","year":"1989","unstructured":"McCuaig W., Shepherd B.: Domination in graphs with minimum degree two. J. Graph Theory 13, 749\u2013762 (1989)","journal-title":"J. Graph Theory"},{"key":"918_CR20","first-page":"206","volume":"38","author":"O. Ore","year":"1962","unstructured":"Ore O.: Theory of graphs. Am. Math. Soc. Transl. 38, 206\u2013212 (1962)","journal-title":"Am. Math. Soc. Transl."},{"key":"918_CR21","first-page":"307","volume":"17","author":"C. Payan","year":"1975","unstructured":"Payan C.: Sur le nombre d\u2019absorption d\u2019un graphe simple (French). Cah. Cent. \u00c9tud. Rech. Op\u00e9r. 17, 307\u2013317 (1975)","journal-title":"Cah. Cent. \u00c9tud. Rech. Op\u00e9r."},{"key":"918_CR22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/S0963548300002042","volume":"5","author":"B. Reed","year":"1996","unstructured":"Reed B.: Paths, stars and the number three. Combin. Prob. Comput. 5, 267\u2013276 (1996)","journal-title":"Combin. Prob. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0918-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0918-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0918-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0918-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0918-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}