{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:41:29Z","timestamp":1649076089982},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T00:00:00Z","timestamp":1411689600000},"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":[[2015,9]]},"DOI":"10.1007\/s00373-014-1468-3","type":"journal-article","created":{"date-parts":[[2014,9,25]],"date-time":"2014-09-25T11:09:49Z","timestamp":1411643389000},"page":"1689-1702","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Bounding the Difference of the Maximum Degree and the Clique Number"],"prefix":"10.1007","volume":"31","author":[{"given":"Oliver","family":"Schaudt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Weil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,26]]},"reference":[{"key":"1468_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"1468_CR2","unstructured":"Toft, B.: Coloring, stable sets and perfect graphs. In: Graham, R., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol. I, pp. 233\u2013288. North-Holland, Amsterdam (1995)"},{"key":"1468_CR3","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"1468_CR4","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: Topics on Perfect Graphs. North-Holland Mathematics Studies, vol. 88, pp. 325\u2013356 (1984)","DOI":"10.1016\/S0304-0208(08)72943-8"},{"key":"1468_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"1468_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur les coloriages des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"1468_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K","volume":"27","author":"B Reed","year":"1998","unstructured":"Reed, B.: Omega, delta, and chi. J. Graph Theory 27, 177\u2013212 (1998)","journal-title":"J. Graph Theory"},{"key":"1468_CR8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.4153\/CJM-1965-072-1","volume":"17","author":"A Hajnal","year":"1965","unstructured":"Hajnal, A.: A theorem on k-saturated graphs. Can. J. Math. 17, 720\u2013724 (1965)","journal-title":"Can. J. Math."},{"key":"1468_CR9","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/jgt.21684","volume":"73","author":"D Christofides","year":"2013","unstructured":"Christofides, D., Edwards, K., King, A.D.: A note on hitting maximum and maximal cliques with a stable set. J. Graph Theory 73, 327\u2013341 (2013)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1468_CR10","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1137\/S089548019936521X","volume":"16","author":"Y Metelsky","year":"2003","unstructured":"Metelsky, Y., Tyshkevich, R.: Line graphs of Helly hypergraphs. SIAM J. Discret. Math. 16(3), 438\u2013448 (2003)","journal-title":"SIAM J. Discret. Math."},{"key":"1468_CR11","doi-asserted-by":"crossref","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, G.: Dominoes. Lecture Notes in Computer Science, vol. 903, pp. 106\u2013120 (1995)","DOI":"10.1007\/3-540-59071-4_41"},{"key":"1468_CR12","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10(1), 26\u201330 (1935)"},{"key":"1468_CR13","unstructured":"King, A.: Claw-free graphs and two conjectures on omega, delta, and chi. Ph.D. dissertation, School of Computer Science, McGill University, Montreal, Canada (2009)"},{"key":"1468_CR14","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.disc.2011.02.021","volume":"311","author":"NR Aravind","year":"2011","unstructured":"Aravind, N.R., Karthick, T., Subramanian, C.R.: Bounding $$\\chi $$ \u03c7 in terms of $$\\omega $$ \u03c9 and $$\\Delta $$ \u0394 for some classes of graphs. Discret. Math. 311, 911\u2013920 (2011)","journal-title":"Discret. Math."},{"issue":"1","key":"1468_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1137\/110847585","volume":"27","author":"M Chudnovsky","year":"2013","unstructured":"Chudnovsky, M., King, A.D., Plumettaz, M., Seymour, P.: A local strengthening of Reed\u2019s $$\\omega $$ \u03c9 , $$\\Delta $$ \u0394 , $$\\chi $$ \u03c7 conjecture for quasi-line graphs. SIAM J. Discret. Math. 27(1), 95\u2013108 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"1468_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.jctb.2004.09.006","volume":"93","author":"B Farzad","year":"2005","unstructured":"Farzad, B., Molloy, M., Reed, B.: $$(\\Delta -k)$$ ( \u0394 - k ) -critical graphs. J. Comb. Theory Ser. B 93, 173\u2013185 (2005)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1468-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1468-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1468-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T11:08:24Z","timestamp":1565867304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1468-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,26]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1468"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1468-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,26]]}}}