{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:27:37Z","timestamp":1774466857701,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["3-30-XXXX-1907-41-2976"],"award-info":[{"award-number":["3-30-XXXX-1907-41-2976"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ISP-8011451"],"award-info":[{"award-number":["ISP-8011451"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005877","name":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005877","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0012-365x(88)90192-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"35-47","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Gallai theorems for graphs, hypergraphs, and set systems"],"prefix":"10.1016","volume":"72","author":[{"given":"E.J.","family":"Cockayne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Laskar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90192-6_BIB1","unstructured":"B. Bollob\u00e1s, E.J. Cockayne and C.M. Mynhardt, On generalized minimal domination parameters for paths. Submitted."},{"key":"10.1016\/0012-365X(88)90192-6_BIB2","series-title":"Technical Report No. 59","article-title":"Partitions of sets with hereditary properties","author":"Cockayne","year":"1974"},{"key":"10.1016\/0012-365X(88)90192-6_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","article-title":"Total domination in graphs","volume":"10","author":"Cockayne","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0012-365X(88)90192-6_BIB4","first-page":"133","article-title":"\u00dcber extreme Punkt-und Kantenmengen. Ann. Univ. Sci. Budapest","volume":"2","author":"Gallai","year":"1959","journal-title":"E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/0012-365X(88)90192-6_BIB5","first-page":"139","article-title":"Max-min parameters and disconnected coloring","volume":"44","author":"Hare","year":"1984","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0012-365X(88)90192-6_BIB6","series-title":"Combinatorial structures and their applications","first-page":"163","article-title":"Disconnected colorings of graphs","author":"Hedetniemi","year":"1970"},{"key":"10.1016\/0012-365X(88)90192-6_BIB7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0095-8956(73)80009-7","article-title":"Hereditary properties of graphs","volume":"14","author":"Hedetniemi","year":"1973","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(88)90192-6_BIB8","first-page":"3","article-title":"A max-min relationship between matching and domination in graphs","volume":"40","author":"Hedetniemi","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0012-365X(88)90192-6_BIB9","series-title":"Graph theory and combinatorics","first-page":"209","article-title":"Connected domination in graphs","author":"Hedetniemi","year":"1984"},{"key":"10.1016\/0012-365X(88)90192-6_BIB10","first-page":"5","article-title":"A bipartite theory of graphs I","volume":"55","author":"Hedetniemi","year":"1986","journal-title":"Congressus Numeratium"},{"key":"10.1016\/0012-365X(88)90192-6_BIB11","unstructured":"S.T. Hedetniemi and R. Laskar, A bipartite theory of graphs II, to appear."},{"key":"10.1016\/0012-365X(88)90192-6_BIB12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(84)90021-0","article-title":"A matroid generalization of theorems of Lewin and Gallai","volume":"9","author":"Kajitani","year":"1984","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0012-365X(88)90192-6_BIB13","series-title":"Lecture notes in pure and applied mathematics","first-page":"183","article-title":"Generating sets in finite projective planes. Finite geometries","author":"Laskar","year":"1985"},{"key":"10.1016\/0012-365X(88)90192-6_BIB14","first-page":"639","article-title":"Strong independence in graphs","volume":"29","author":"McFall","year":"1980","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0012-365X(88)90192-6_BIB15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","article-title":"Two bounds for the domination number of a graph","volume":"14","author":"Nieminen","year":"1974","journal-title":"J. Inst. Math. Applic."},{"key":"10.1016\/0012-365X(88)90192-6_BIB16","first-page":"59","article-title":"Maximal\/minimal connectivity in graphs","volume":"21","author":"Peters","year":"1986","journal-title":"ARS Combinatoria"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901926?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901926?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:35:17Z","timestamp":1757079317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88901926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0012365X88901926"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90192-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Gallai theorems for graphs, hypergraphs, and set systems","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(88)90192-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}