{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T14:29:07Z","timestamp":1714055347689},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"J\u00e1nos Bolyai Research Scholarship of the Hungarian Academy of Sciences"},{"name":"Hungarian Research Grant","award":["K 120154"],"award-info":[{"award-number":["K 120154"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1945-1","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T03:42:17Z","timestamp":1535341337000},"page":"1385-1394","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Coupon-Coloring and Total Domination in Hamiltonian Planar Triangulations"],"prefix":"10.1007","volume":"34","author":[{"given":"Zolt\u00e1n L\u00f3r\u00e1nt","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"1945_CR1","first-page":"45","volume":"1","author":"H Aram","year":"2012","unstructured":"Aram, H., Sheikholeslami, S.M., Volkmann, L.: On the total domatic number of regular graphs. Trans. Comb. 1, 45\u201351 (2012)","journal-title":"Trans. Comb."},{"key":"1945_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.dam.2015.04.026","volume":"193","author":"B Chen","year":"2015","unstructured":"Chen, B., Kim, J.H., Tait, M., Verstraete, J.: On coupon colorings of graphs. Discrete Appl. Math. 193, 94\u2013101 (2015)","journal-title":"Discrete Appl. Math."},{"key":"1945_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10, 211\u2013219 (1980)","journal-title":"Networks"},{"key":"1945_CR4","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.dam.2016.10.020","volume":"217","author":"M Dorfling","year":"2017","unstructured":"Dorfling, M., Hattingh, J.H., Jonck, E.: Total domination in maximal outerplanar graphs. Discrete Appl. Math. 217, 506\u2013511 (2017)","journal-title":"Discrete Appl. Math."},{"key":"1945_CR5","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1016\/j.disc.2015.11.003","volume":"339","author":"M Dorfling","year":"2016","unstructured":"Dorfling, M., Hattingh, J.H., Jonck, E.: Total domination in maximal outerplanar graphs II. Discrete Math. 339, 1180\u20131188 (2016)","journal-title":"Discrete Math."},{"key":"1945_CR6","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.disc.2005.06.020","volume":"300","author":"M Dorfling","year":"2005","unstructured":"Dorfling, M., Goddard, W., Hattingh, J.H., Henning, M.A.: Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Math. 300, 82\u201390 (2005)","journal-title":"Discrete Math."},{"key":"1945_CR7","first-page":"5","volume":"11","author":"P Erd\u0151s","year":"1963","unstructured":"Erd\u0151s, P.: On a combinatorial problem. Nordisk. Mat. Tidskr. 11, 5\u201310 (1963)","journal-title":"Nordisk. Mat. Tidskr."},{"key":"1945_CR8","unstructured":"Goddard, W., Henning. M. A.: Thoroughly distributed colorings. \n                    arXiv:1609.09684\n                    \n                   (2016)"},{"key":"1945_CR9","unstructured":"Helden, G.: Hamiltonicity of maximal planar graphs and planar triangulations, Ph.D. thesis, RWTH Aachen (2007)"},{"key":"1945_CR10","volume-title":"TotaL Domination in Graphs","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Yeo, A.: TotaL Domination in Graphs. Springer Science & Business Media, New Yorrk (2014)"},{"key":"1945_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discrete Math. 309, 32\u201363 (2009)","journal-title":"Discrete Math."},{"key":"1945_CR12","first-page":"333","volume-title":"Lecture Notes in Computer Science","author":"Mikko Koivisto","year":"2017","unstructured":"Koivisto, M., Laakkonen, P., Lauri, J.: NP-Completeness Results for Partitioning a Graph into Total Dominating Sets, Computing and Combinatorics 23rd International Conference, COCOON. 333\u2013345. Springer, New York (2017)"},{"key":"1945_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s004930100011","volume":"21","author":"AV Kostochka","year":"2001","unstructured":"Kostochka, A.V., Woodall, D.R.: Density conditions for panchromatic colourings of hypergraphs. Combinatorica 21, 515\u2013541 (2001)","journal-title":"Combinatorica"},{"key":"1945_CR14","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1007\/s00373-017-1802-7","volume":"33","author":"M Lema\u0144ska","year":"2017","unstructured":"Lema\u0144ska, M., Zuazua, R., \u0179yli\u0144ski, P.: Total Dominating Sets in Maximal Outerplanar Graphs. Graphs Combin. 33, 991\u2013998 (2017)","journal-title":"Graphs Combin."},{"key":"1945_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10878-015-9942-2","volume":"33","author":"Y Shi","year":"2017","unstructured":"Shi, Y., Wei, M., Yue, J., Zhao, Y.: Coupon coloring of some special graphs. J. Combin. Optim. 33, 156\u2013164 (2017)","journal-title":"J. Combin. Optim."},{"key":"1945_CR16","first-page":"7","volume":"39","author":"B Zelinka","year":"1989","unstructured":"Zelinka, B.: Total domatic number and degrees of vertices of a graph. Math. Slovaca 39, 7\u201311 (1989)","journal-title":"Math. Slovaca"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1945-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1945-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1945-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T19:17:09Z","timestamp":1566847029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1945-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1945"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1945-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,27]]},"assertion":[{"value":"13 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}