{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:25:57Z","timestamp":1649039157511},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0166-218x(99)00183-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:53:20Z","timestamp":1027612400000},"page":"175-188","source":"Crossref","is-referenced-by-count":0,"title":["The even adjacency split problem for graphs"],"prefix":"10.1016","volume":"102","author":[{"given":"Grant A.","family":"Cheston","sequence":"first","affiliation":[]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"Arthur L.","family":"Liestman","sequence":"additional","affiliation":[]},{"given":"J.B.","family":"Stehman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00183-3_BIB1","unstructured":"H. Balakrishnan, A. Rajaratman, C. Pandu Rangan, C.K. Wong, The even adjacency split problem on certain classes of perfect graphs, Manuscript, Indian Institute of Technology, Madras, India, 1997."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90226-Z","article-title":"Sparse broadcast graphs","volume":"36","author":"Bermond","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB3","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","article-title":"Implementation and analysis of binomial queue algorithms","volume":"7","author":"Brown","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB4","first-page":"110","article-title":"Constructing minimal broadcast networks","volume":"10","author":"Chau","year":"1985","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB5","first-page":"1","article-title":"Constructing fault-tolerant minimal broadcast networks","volume":"11","author":"Chau","year":"1986","journal-title":"J. Combin. Inform. System Sci."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","article-title":"On the complexity of partitioning graphs into connected subgraphs","volume":"10","author":"Dyer","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB7","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, 1979."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB8","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1002\/net.3230190606","article-title":"On the construction of minimal broadcast networks","volume":"19","author":"Gargano","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00183-3_BIB9","first-page":"145","article-title":"Partitions in tournaments","volume":"132","author":"Ghoshal","year":"1998","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","article-title":"Tight bounds on minimum broadcast networks","volume":"4","author":"Grigni","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB11","unstructured":"E. Gy\u00f6ri, On division of graphs to connected subgraphs, in: A. Hajnal, V.T. S\u00f3s (Eds.), Combinatorics, Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 18, 1976, North-Holland, New York, 1978, pp. 485\u2013494."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB12","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, R. Laskar, L. Markus, P.J. Slater, Dual domination in graphs, in preparation."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB13","unstructured":"D.E. Knuth, The Art of Computer Programming: Vol. 3, Sorting and Searching, Addison-Wesley, Reading, MA, 1973."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0206012","article-title":"A linear tree partitioning algorithm","volume":"6","author":"Kundu","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00183-3_BIB15","doi-asserted-by":"crossref","unstructured":"O. Ore, Theory of Graphs, American Mathematical Society, Providence, RI, 1962.","DOI":"10.1090\/coll\/038"},{"key":"10.1016\/S0166-218X(99)00183-3_BIB16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Commun. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:57:02Z","timestamp":1556301422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0166218X99001833"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00183-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}