{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:02:08Z","timestamp":1740096128641,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_24","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"238-241","source":"Crossref","is-referenced-by-count":3,"title":["On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs"],"prefix":"10.1007","author":[{"given":"Oudone","family":"Phanalasy","sequence":"first","affiliation":[]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Leanne","family":"Rylands","sequence":"additional","affiliation":[]},{"given":"Paulette","family":"Lieby","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/jgt.20027","volume":"47","author":"N. Alon","year":"2004","unstructured":"Alon, N., Kaplan, G., Lev, A., Roditty, Y., Yuster, R.: Dense graphs are antimagic. J. Graph Theory\u00a047(4), 297\u2013309 (2004), \n                  \n                    http:\/\/dx.doi.org\/10.1002\/jgt.20027","journal-title":"J. Graph Theory"},{"key":"24_CR2","volume-title":"Super Edge-Antimagic Graphs: a Wealth of Problems and Some Solutions","author":"M. Ba\u010da","year":"2008","unstructured":"Ba\u010da, M., Miller, M.: Super Edge-Antimagic Graphs: a Wealth of Problems and Some Solutions. BrownWalker Press, Boca Raton (2008)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"G.S. Bloom","year":"1977","unstructured":"Bloom, G.S., Golomb, S.W.: Applications of numbered undirected graphs. Proc. IEEE\u00a065, 562\u2013570 (1977)","journal-title":"Proc. IEEE"},{"key":"24_CR4","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BFb0070364","volume-title":"Theory and Applications of Graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976)","author":"G.S. Bloom","year":"1978","unstructured":"Bloom, G.S., Golomb, S.W.: Numbered complete graphs, unusual rulers, and assorted applications. In: Theory and Applications of Graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976). Lecture Notes in Math., vol.\u00a0642, pp. 53\u201365. Springer, Berlin (1978)"},{"issue":"24","key":"24_CR5","doi-asserted-by":"publisher","first-page":"6441","DOI":"10.1016\/j.disc.2007.12.032","volume":"308","author":"Y. Cheng","year":"2008","unstructured":"Cheng, Y.: A new class of antimagic Cartesian product graphs. Discrete Math.\u00a0308(24), 6441\u20136448 (2008), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.disc.2007.12.032","journal-title":"Discrete Math."},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/jgt.20347","volume":"60","author":"D.W. Cranston","year":"2009","unstructured":"Cranston, D.W.: Regular bipartite graphs are antimagic. J. Graph Theory\u00a060(3), 173\u2013182 (2009), \n                  \n                    http:\/\/dx.doi.org\/10.1002\/jgt.20347","journal-title":"J. Graph Theory"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0021-9800(69)80011-6","volume":"7","author":"T.J. Dickson","year":"1969","unstructured":"Dickson, T.J.: On a problem concerning separating systems of a finite set. J. Combinatorial Theory\u00a07, 191\u2013196 (1969)","journal-title":"J. Combinatorial Theory"},{"key":"24_CR8","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 16(\n                  \n                    \n                  \n                  $\\sharp$\n                DS6) (2009)"},{"key":"24_CR9","volume-title":"Pearls in graph theory: a comprehensive introduction","author":"N. Hartsfield","year":"1990","unstructured":"Hartsfield, N., Ringel, G.: Pearls in graph theory: a comprehensive introduction. Academic Press Inc., Boston (1990)"},{"key":"24_CR10","first-page":"3","volume":"45","author":"O. Phanalasy","year":"2009","unstructured":"Phanalasy, O., Roberts, I., Rylands, L.: Covering separating systems and an application to search theory. Australas. J. Combin.\u00a045, 3\u201314 (2009)","journal-title":"Australas. J. Combin."},{"key":"24_CR11","first-page":"129","volume":"13","author":"C. Ramsay","year":"1996","unstructured":"Ramsay, C., Roberts, I.T.: Minimal completely separating systems of sets. Australas. J. Combin.\u00a013, 129\u2013150 (1996)","journal-title":"Australas. J. Combin."},{"issue":"1-3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0012-365X(97)00059-9","volume":"183","author":"C. Ramsay","year":"1998","unstructured":"Ramsay, C., Roberts, I.T., Ruskey, F.: Completely separating systems of k-sets. Discrete Math.\u00a0183(1-3), 265\u2013275 (1998)","journal-title":"Discrete Math."},{"key":"24_CR13","unstructured":"Roberts, I.T.: Extremal Problems and Designs on Finite Sets. Ph.D. thesis, Curtin University of Technology (1999)"},{"key":"24_CR14","unstructured":"Roberts, I., D\u2019Arcy, S., Gilbert, K., Rylands, L., Phanalasy, O.: Separating systems, Sperner systems, search theory. In: Ryan, J., Manyem, P., Sugeng, K., Miller, M. (eds.) Proceedings of the Sixteenth Australasian Workshop on Combinatorial Algorithms, pp. 279\u2013288 (September 2005)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/11533719_68","volume-title":"Computing and Combinatorics","author":"T.M. Wang","year":"2005","unstructured":"Wang, T.M.: Toroidal grids are anti-magic. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 671\u2013679. Springer, Heidelberg (2005)"},{"issue":"16","key":"24_CR16","doi-asserted-by":"publisher","first-page":"3624","DOI":"10.1016\/j.disc.2007.07.027","volume":"308","author":"T.M. Wang","year":"2008","unstructured":"Wang, T.M., Hsiao, C.C.: On anti-magic labeling for graph products. Discrete Math.\u00a0308(16), 3624\u20133633 (2008)","journal-title":"Discrete Math."},{"issue":"8-10","key":"24_CR17","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.tcs.2008.10.023","volume":"410","author":"Y. Zhang","year":"2009","unstructured":"Zhang, Y., Sun, X.: The antimagicness of the cartesian product of graphs. Theor. Comput. Sci.\u00a0410(8-10), 727\u2013735 (2009)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:24:14Z","timestamp":1558423454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}