{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:41:26Z","timestamp":1777430486785,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T00:00:00Z","timestamp":1525996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1902-z","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T03:17:26Z","timestamp":1526008646000},"page":"639-645","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graphs with \n                \n                  \n                \n                $$\\alpha _1$$\n                \n                  \n                    \n                      \u03b1\n                      1\n                    \n                  \n                \n               and \n                \n                  \n                \n                $$\\tau _1$$\n                \n                  \n                    \n                      \u03c4\n                      1\n                    \n                  \n                \n               Both Large"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0502-981X","authenticated-orcid":false,"given":"Gregory J.","family":"Puleo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"issue":"1","key":"1902_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-011-1040-3","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.: \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -domination and \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -independence in graphs: a survey. Graphs Combin. 28(1), 1\u201355 (2012). \n                    https:\/\/doi.org\/10.1007\/s00373-011-1040-3","journal-title":"Graphs Combin."},{"key":"1902_CR2","unstructured":"Erd\u0151s, P.: Some of my old and new combinatorial problems. In: Paths, flows, and VLSI-layout (Bonn, 1988), Algorithms Combin., vol.\u00a09, pp. 35\u201345. Springer, Berlin (1990)"},{"issue":"1\u20133","key":"1902_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0012-365X(95)00178-Y","volume":"150","author":"P Erd\u0151s","year":"1996","unstructured":"Erd\u0151s, P., Gallai, T., Tuza, Z.: Covering and independence in triangle structures. Disc. Math. 150(1\u20133), 89\u2013101 (1996). \n                    https:\/\/doi.org\/10.1016\/0012-365X(95)00178-Y","journal-title":"Disc. Math."},{"issue":"1","key":"1902_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0095-8956(85)90040-1","volume":"39","author":"O Favaron","year":"1985","unstructured":"Favaron, O.: On a conjecture of Fink and Jacobson concerning \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -domination and \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -dependence. J. Combin. Theory Ser. B 39(1), 101\u2013102 (1985). \n                    https:\/\/doi.org\/10.1016\/0095-8956(85)90040-1","journal-title":"J. Combin. Theory Ser. B"},{"key":"1902_CR5","unstructured":"Fink, J.F., Jacobson, M.S.: \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -domination in graphs. In: Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., pp. 283\u2013300. Wiley, New York (1985)"},{"key":"1902_CR6","unstructured":"Fink, J.F., Jacobson, M.S.: On \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -domination, \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -dependence and forbidden subgraphs. In: Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., pp. 301\u2013311. Wiley, New York (1985)"},{"key":"1902_CR7","doi-asserted-by":"publisher","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000). \n                    https:\/\/doi.org\/10.1002\/9781118032718","DOI":"10.1002\/9781118032718"},{"issue":"3","key":"1902_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"JH Kim","year":"1995","unstructured":"Kim, J.H.: The Ramsey number \n                    \n                      \n                    \n                    $$R(3, t)$$\n                    \n                      \n                        \n                          R\n                          (\n                          3\n                          ,\n                          t\n                          )\n                        \n                      \n                    \n                   has order of magnitude \n                    \n                      \n                    \n                    $$t^2\/\\log t$$\n                    \n                      \n                        \n                          \n                            t\n                            2\n                          \n                          \/\n                          log\n                          t\n                        \n                      \n                    \n                  . Random Struct. Algorithms 7(3), 173\u2013207 (1995). \n                    https:\/\/doi.org\/10.1002\/rsa.3240070302","journal-title":"Random Struct. Algorithms"},{"key":"1902_CR9","unstructured":"Norin, S., Sun, Y.R.: Triangle-independent sets vs. cuts (2016). \n                    ArXiv:1602.04370"},{"issue":"7","key":"1902_CR10","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1016\/j.disc.2017.02.020","volume":"340","author":"GJ Puleo","year":"2017","unstructured":"Puleo, G.J.: Maximal \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -edge-colorable subgraphs, Vizing\u2019s theorem, and Tuza\u2019s conjecture. Disc. Math. 340(7), 1573\u20131580 (2017). \n                    https:\/\/doi.org\/10.1016\/j.disc.2017.02.020","journal-title":"Disc. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1902-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1902-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1902-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T19:39:14Z","timestamp":1557517154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1902-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,11]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1902"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1902-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,11]]},"assertion":[{"value":"19 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}