{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T05:30:53Z","timestamp":1671773453731},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,12]],"date-time":"2016-04-12T00:00:00Z","timestamp":1460419200000},"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":[[2016,9]]},"DOI":"10.1007\/s00373-016-1697-8","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T09:47:00Z","timestamp":1460627220000},"page":"1699-1705","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Vertex Arboricity and Vertex Degrees"],"prefix":"10.1007","volume":"32","author":[{"given":"D.","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nevo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Schmeichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,12]]},"reference":[{"key":"1697_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-014-1465-6","volume":"31","author":"D Bauer","year":"2015","unstructured":"Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Nevo, A., Schmeichel, E., Woodall, D.R., Yatauro, M.: Best monotone degree conditions for graph properties: a survey. Graphs Comb. 31, 1\u201322 (2015). doi: 10.1007\/s00373-014-1465-6","journal-title":"Graphs Comb."},{"key":"1697_CR2","volume-title":"Graphs Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C.: Graphs Hypergraphs. North-Holland, Amsterdam (1973)"},{"key":"1697_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","volume":"12","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V.: On Hamilton\u2019s ideals. J. Comb. Theory Ser. B 12, 163\u2013168 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1697_CR4","volume-title":"Computers and Intractability","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman, San Francisco (1979)"},{"key":"1697_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/0402007","volume":"2","author":"SL Hakimi","year":"1989","unstructured":"Hakimi, S.L., Schmeichel, E.: A note on the vertex arboricity of a graph. SIAM J. Discret. Math. 2, 64\u201367 (1989)","journal-title":"SIAM J. Discret. Math."},{"key":"1697_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","volume":"17","author":"GH Hardy","year":"1918","unstructured":"Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. 17, 75\u2013115 (1918)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1697_CR7","doi-asserted-by":"crossref","unstructured":"Nash-Williams, C.St.J.A.: Hamiltonian arcs and circuits. In: Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol. 186, pp. 197\u2013210. Springer, Berlin (1971)","DOI":"10.1007\/BFb0059438"},{"key":"1697_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number and its application to timetabling problems. Comput. J. 10, 85\u201386 (1967)","journal-title":"Comput. J."},{"key":"1697_CR9","volume-title":"Introduction to Graph Theory","author":"D West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1697-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1697-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1697-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:43Z","timestamp":1559055583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1697-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,12]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1697"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1697-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,12]]}}}