{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T17:50:50Z","timestamp":1721843450397},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T00:00:00Z","timestamp":1436486400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9929-z","type":"journal-article","created":{"date-parts":[[2015,7,9]],"date-time":"2015-07-09T07:23:11Z","timestamp":1436426591000},"page":"28-34","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree"],"prefix":"10.1007","volume":"33","author":[{"given":"Xiao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,10]]},"reference":[{"key":"9929_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0166-218X(01)00277-3","volume":"120","author":"S Brandt","year":"2002","unstructured":"Brandt S (2002) Triangle-free graphs and forbidden subgraphs. Discret Appl Math 120:25\u201333","journal-title":"Discret Appl Math"},{"key":"9929_CR2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks RL (1941) On colouring the nodes of a network. Math Proc Camb Philos Soc 37:194\u2013197","journal-title":"Math Proc Camb Philos Soc"},{"key":"9929_CR3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P (1959) Graph theory and probability. Can J Math 11:34\u201338","journal-title":"Can J Math"},{"key":"9929_CR4","first-page":"413","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s A (1987) Problems from the world surrounding perfect graphs. Zastos Mat 19:413\u2013441","journal-title":"Zastos Mat"},{"key":"9929_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(80)90230-7","volume":"30","author":"A Gy\u00e1rf\u00e1s","year":"1980","unstructured":"Gy\u00e1rf\u00e1s A, Szemer\u00e9di E, Tuza Z (1980) Induced subtrees in graphs of large chromatic number. Discret Math 30:235\u2013244","journal-title":"Discret Math"},{"key":"9929_CR6","volume-title":"Graph coloring problems","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Toft B (1995) Graph coloring problems. Wiley, New York"},{"key":"9929_CR7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0012-365X(03)00312-1","volume":"276","author":"B Randerath","year":"2004","unstructured":"Randerath B (2004) 3-colorability and forbidden subgraphs. I: characterizing pairs. Discret Math 276:313\u2013325","journal-title":"Discret Math"},{"key":"9929_CR8","first-page":"3","volume":"26","author":"B Randerath","year":"2002","unstructured":"Randerath B, Schiermeyer I (2002) A note on Brooks\u2019 theorem for triangle-free graphs. Aust J Comb 26:3\u20139","journal-title":"Aust J Comb"},{"key":"9929_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B Randerath","year":"2004","unstructured":"Randerath B, Schiermeyer I (2004) Vertex colouring and forbidden subgraphs\u2014a survey. Graph Comb 20:1\u201340","journal-title":"Graph Comb"},{"key":"9929_CR10","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":"37","author":"B Reed","year":"1998","unstructured":"Reed B (1998) $$\\omega, \\Delta $$ \u03c9 , \u0394 and $$\\chi $$ \u03c7 . J Graph Theory 37:177\u2013212","journal-title":"J Graph Theory"},{"key":"9929_CR11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","volume":"29","author":"S Wagon","year":"1980","unstructured":"Wagon S (1980) A bound on the chromatic number of graphs without certain induced subgraphs. J Comb Theory Ser B 29:345\u2013346","journal-title":"J Comb Theory Ser B"},{"key":"9929_CR12","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River","edition":"2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9929-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9929-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9929-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9929-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:27Z","timestamp":1559262207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9929-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9929"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9929-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,10]]}}}