{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:50Z","timestamp":1740107150892,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T00:00:00Z","timestamp":1563148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T00:00:00Z","timestamp":1563148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["No.~725978"],"award-info":[{"award-number":["No.~725978"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00373-019-02063-w","type":"journal-article","created":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T16:03:11Z","timestamp":1563206591000},"page":"1129-1138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Disjoint Paired-Dominating sets in Cubic Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"G\u00e1bor","family":"Bacs\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0511-5291","authenticated-orcid":false,"given":"Csilla","family":"Bujt\u00e1s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Casey","family":"Tompkins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,15]]},"reference":[{"key":"2063_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.7151\/dmgt.1996","volume":"38","author":"S Akbari","year":"2018","unstructured":"Akbari, S., Motiei, M., Mozaffari, S., Yazdanbod, S.: Cubic graphs with total domatic number at least two. Discuss. Math.Graph Theory 38, 75\u201382 (2018)","journal-title":"Discuss. Math.Graph Theory"},{"key":"2063_CR2","unstructured":"Beineke, L.W.: On derived graphs and digraphs. In: Sachs, H., Voss, H.-J., Walther, H.-J. (eds.) Beitr\u00e4ge zur Graphentheorie, pp. 17\u201323. Teubner (1968)"},{"key":"2063_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","volume":"9","author":"LW Beineke","year":"1970","unstructured":"Beineke, L.W.: Characterization of derived graphs. J. Comb. Theory 9, 129\u2013135 (1970)","journal-title":"J. Comb. Theory"},{"key":"2063_CR4","first-page":"255","volume":"73","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar, B., Henning, M.A., Rall, D.F.: Paired-domination of Cartesian products of graphs. Util. Math. 73, 255\u2013265 (2007)","journal-title":"Util. Math."},{"key":"2063_CR5","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00373-015-1585-7","volume":"32","author":"Cs Bujt\u00e1s","year":"2016","unstructured":"Bujt\u00e1s, Cs, Klav\u017ear, S.: Improved upper bounds on the domination number of graphs with minimum degree at least five. Graphs Comb. 32, 511\u2013519 (2016)","journal-title":"Graphs Comb."},{"key":"2063_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2017.01.032","volume":"223","author":"WJ Desormeaux","year":"2017","unstructured":"Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Partitioning the vertices of a cubic graph into two total dominating sets. Discret. Appl. Math. 223, 52\u201363 (2017)","journal-title":"Discret. Appl. Math."},{"key":"2063_CR7","first-page":"101","volume":"94","author":"WJ Desormeaux","year":"2014","unstructured":"Desormeaux, W.J., Henning, M.A.: Paired domination in graphs: a survey and recent results. Util. Math. 94, 101\u2013166 (2014)","journal-title":"Util. Math."},{"key":"2063_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00373-004-0577-9","volume":"20","author":"O Favaron","year":"2004","unstructured":"Favaron, O., Henning, M.A.: Paired-domination in claw-free cubic graphs. Graphs Comb. 20, 447\u2013456 (2004)","journal-title":"Graphs Comb."},{"key":"2063_CR9","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)"},{"key":"2063_CR10","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. Discret. Math. 309, 32\u201363 (2009)","journal-title":"Discret. Math."},{"key":"2063_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer Monographs in Mathematics, New York (2013)"},{"key":"2063_CR12","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a $$p$$-graph (in Russian). Diskret. Analiz 3, 25\u201330 (1964)","journal-title":"Diskret. Analiz"},{"key":"2063_CR13","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\/content\/pdf\/10.1007\/s00373-019-02063-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02063-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02063-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T23:19:05Z","timestamp":1594682345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02063-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,15]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2063"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02063-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,7,15]]},"assertion":[{"value":"10 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Open access funding provided by University of Pannonia (PE).","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}}]}}