{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T20:17:57Z","timestamp":1773001077779,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"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":[[2008,2]]},"DOI":"10.1007\/s00373-007-0770-8","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T06:24:51Z","timestamp":1202970291000},"page":"37-46","source":"Crossref","is-referenced-by-count":17,"title":["Domination in Graphs of Minimum Degree at least Two and Large Girth"],"prefix":"10.1007","volume":"24","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","reference":[{"key":"770_CR1","unstructured":"Blank, M.: An estimate of the external stability number of a graph without suspended vertices. Prikl Math i Programmirovanie Vyp 10, 3\u201311 (1973)"},{"key":"770_CR2","unstructured":"Brigham, R.C., Dutton, R.D.: Bounds on the domination number of a graph. Q. J. Math., Oxf. II. Ser. 41, 269\u2013275 (1990)"},{"key":"770_CR3","doi-asserted-by":"crossref","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37, 194\u2013197 (1941)","DOI":"10.1017\/S030500410002168X"},{"key":"770_CR4","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker, Inc., New York (1998)"},{"key":"770_CR5","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs advanced topics. Marcel Dekker, Inc., New York (1998)"},{"key":"770_CR6","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Plummer, M.D., Saito, A.: Domination in a graph with a 2-factor. J. Graph Theory 52, 1\u20136 (2006)","DOI":"10.1002\/jgt.20142"},{"key":"770_CR7","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Stodolsky, B.Y.: On domination in connected cubic graphs. Discrete Math. 304, 45\u201350 (2005)","DOI":"10.1016\/j.disc.2005.07.005"},{"key":"770_CR8","unstructured":"Kostochka, A.V., Stodolsky, B.Y.: An upper bound on the domination number of n-vertex connected cubic graphs. manuscript (2005)"},{"key":"770_CR9","doi-asserted-by":"crossref","unstructured":"McCuaig, W., Shepherd, B.: Domination in graphs with minimum degree two. J. Graph Theory 13, 749\u2013762 (1989)","DOI":"10.1002\/jgt.3190130610"},{"key":"770_CR10","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of graphs. Amer. Math. Soc. Colloq. Publ. 38 (1962)","DOI":"10.1090\/coll\/038"},{"key":"770_CR11","doi-asserted-by":"crossref","unstructured":"Randerath, B., Volkmann, L.: Characterization of graphs with equal domination and covering number. Discrete Math. 191, 159\u2013169 (1998)","DOI":"10.1016\/S0012-365X(98)00103-4"},{"key":"770_CR12","unstructured":"Rautenbach, D.: A Note on domination, girth and minimum degree. Discrete Math. (to appear)"},{"key":"770_CR13","unstructured":"Reed, B.: Paths, stars and the number three. Combin. Prob. Comput. 5, 267\u2013276 (1996)"},{"key":"770_CR14","unstructured":"Volkmann, L.: Upper bounds on the domination number of a graph in terms of diameter and girth. J. Combin. Math. Combin. Comput. 52, 131\u2013141 (2005)"},{"key":"770_CR15","unstructured":"Volkmann, L.: An upper bound for the domination number of a graph in terms of order and girth. J. Combin. Math. Combin. Comput. 54, 195\u2013212 (2005)"},{"key":"770_CR16","doi-asserted-by":"crossref","unstructured":"Xu, B., Cockayne, E.J., Haynes, T.H., Hedetniemi, S.T., Zhou, S.: Extremal graphs for inequalities involving domination parameters. Discrete Math. 216, 1\u201310 (2000)","DOI":"10.1016\/S0012-365X(99)00251-4"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0770-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0770-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0770-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0770-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["770"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0770-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}