{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:35Z","timestamp":1750694675336},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3669,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0012-365x(03)00055-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"265-271","source":"Crossref","is-referenced-by-count":5,"title":["2-connected graphs with small 2-connected dominating sets"],"prefix":"10.1016","volume":"269","author":[{"given":"Yair","family":"Caro","sequence":"first","affiliation":[]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00055-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01787474","article-title":"Transversal numbers of uniform hypergraphs","volume":"6","author":"Alon","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00055-4_BIB2","series-title":"The Probabilistic Method","author":"Alon","year":"1991"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB3","first-page":"3","article-title":"Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices","volume":"11","author":"Arnautov","year":"1974","journal-title":"Prikl. Mat. i Programmirovanie"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB4","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/S0895480199353780","article-title":"Connected domination and spanning trees with many leaves","volume":"13","author":"Caro","year":"2000","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00055-4_BIB6","first-page":"71","article-title":"On Hadwiger's number and stability numbers","volume":"13","author":"Duchet","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00055-4_BIB7","series-title":"Domination in Graphs: The Theory","author":"Haynes","year":"1997"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB8","series-title":"Domination in Graphs: Selected Topics","author":"Haynes","year":"1997"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01261324","article-title":"Covering cycles and k-term degrees sums","volume":"16","author":"Kouider","year":"1996","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal and integral fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00055-4_BIB11","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/jgt.3190130610","article-title":"Domination in graphs with minimum degree two","volume":"13","author":"McCuaig","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00055-4_BIB12","unstructured":"C. Payan, Sur le nombre d'absorption d'un graphe simple, Cahi\u00e8rs Centre Etudes Rech. Op\u00e9r. 17 (1975) 307\u2013317."},{"key":"10.1016\/S0012-365X(03)00055-4_BIB13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/S0963548300002042","article-title":"Paths, stars and the number three","volume":"5","author":"Reed","year":"1996","journal-title":"Combinatorics Probab. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000554?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000554?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:20:55Z","timestamp":1553228455000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03000554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0012365X03000554"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00055-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}