{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:14:52Z","timestamp":1648804492526},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","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,8]]},"DOI":"10.1007\/s10878-016-0094-9","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T04:46:03Z","timestamp":1478839563000},"page":"605-611","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A note on orientation and chromatic number of graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Manouchehr","family":"Zaker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"94_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon N, Tarsi M (1992) Colorings and orientations of graphs. Combinatorica 12:125\u2013134","journal-title":"Combinatorica"},{"key":"94_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0020-0190(99)00120-9","volume":"72","author":"VC Barbosa","year":"1999","unstructured":"Barbosa VC, Szwarcfiter JL (1999) Generating all the acyclic orientations of an undirected graph. Inf Process Lett 72:71\u201374","journal-title":"Inf Process Lett"},{"key":"94_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0095-8956(79)90048-0","volume":"26","author":"RW Deming","year":"1979","unstructured":"Deming RW (1979) Acyclic orientations of a graph and chromatic and independence numbers. J Comb Theory Ser B 26:101\u2013110","journal-title":"J Comb Theory Ser B"},{"key":"94_CR4","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1051\/ro:2008028","volume":"42","author":"RMV Figueiredo","year":"2008","unstructured":"Figueiredo RMV, Barbosa VC, Maculan N, de Souza CC (2008) Acyclic orientations with path constraints. RAIRO Oper Res 42:455\u2013467","journal-title":"RAIRO Oper Res"},{"key":"94_CR5","unstructured":"Gallai T (1968) On directed paths and circuits. In: Erd\u0151s P, Katona G (eds) Theory of Graphs, Proc. Tihany 1966. Academic Press, New York, pp 115\u2013118"},{"key":"94_CR6","volume-title":"Graph coloring problems","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Toft B (1995) Graph coloring problems. Wiley, New York"},{"key":"94_CR7","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.jctb.2008.11.002","volume":"99","author":"K Kawarabayashi","year":"2009","unstructured":"Kawarabayashi K, Thomassen C (2009) Decomposing a planar graph of girth \n                        $$5$$\n                        \n                            \n                                            \n                                \n                                    5\n                                \n                            \n                        \n                     into an independent set and a forest. J Comb Theory Ser B 99:674\u2013684","journal-title":"J Comb Theory Ser B"},{"key":"94_CR8","doi-asserted-by":"crossref","first-page":"573","DOI":"10.2307\/1969755","volume":"58","author":"M Richardson","year":"1953","unstructured":"Richardson M (1953) Solutions of irreflexive relations. Ann of Math 58:573\u2013580","journal-title":"Ann of Math"},{"key":"94_CR9","first-page":"127","volume":"Rouge 1","author":"B Roy","year":"1967","unstructured":"Roy B (1967) Nombre chromatique et plus longs chemins d\u2019un graphe. Rev Fr Autom Inf Rech Op\u00e9r s\u00e9r Rouge 1:127\u2013132","journal-title":"Rev Fr Autom Inf Rech Op\u00e9r s\u00e9r"},{"key":"94_CR10","first-page":"758","volume":"147","author":"LM Vitaver","year":"1962","unstructured":"Vitaver LM (1962) Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix (Russian). Dokl Akad Nauk SSSR 147:758\u2013759","journal-title":"Dokl Akad Nauk SSSR"},{"key":"94_CR11","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1016\/j.disc.2005.09.016","volume":"306","author":"A Yang","year":"2006","unstructured":"Yang A, Yuan J (2006) Partition the vertices of a graph into one independent set and one acyclic set. Discret Math 306:1207\u20131216","journal-title":"Discret Math"},{"key":"94_CR12","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.20298","volume":"58","author":"M Zaker","year":"2008","unstructured":"Zaker M (2008) New bounds for the chromatic number of graphs. J Gr Theory 58:110\u2013122","journal-title":"J Gr Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0094-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0094-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0094-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T03:13:09Z","timestamp":1500261189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0094-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0094-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}