{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:32:23Z","timestamp":1648909943706},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T00:00:00Z","timestamp":1265932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9295-9","type":"journal-article","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T11:18:10Z","timestamp":1265887090000},"page":"499-508","source":"Crossref","is-referenced-by-count":0,"title":["Resource-sharing systems and hypergraph colorings"],"prefix":"10.1007","volume":"22","author":[{"given":"Wu-Hsiung","family":"Lin","sequence":"first","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,12]]},"reference":[{"key":"9295_CR1","unstructured":"Barbosa VC (1986) Concurrency in systems with neighborhood constraints. PhD dissertation, Computer Science Department, University of California, Los Angeles"},{"key":"9295_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s000260200001","volume":"6","author":"VC Barbosa","year":"2002","unstructured":"Barbosa VC (2002) The interleaved multichromatic numbers in graphs. Ann Comb 6:249\u2013256","journal-title":"Ann Comb"},{"key":"9295_CR3","unstructured":"Barbosa VC, Gafni E (1987) Concurrency in systems with neighborhood constraints, in: Proceedings of the 7th international conference on distributed computing systems, Washington, DC, September 1987, pp\u00a0448\u2013455"},{"key":"9295_CR4","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"VC Barbosa","year":"1989","unstructured":"Barbosa VC, Gafni E (1989) Concurrency in heavily loaded neighborhood-constrained system. ACM Trans Program Lang Syst 11:562\u2013584","journal-title":"ACM Trans Program Lang Syst"},{"key":"9295_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s002240010008","volume":"34","author":"VC Barbosa","year":"2001","unstructured":"Barbosa VC, Benevides MRE, Franca FMG (2001) Sharing resources at nonuniform access rates. Theory Comput Syst 34:13\u201326","journal-title":"Theory Comput Syst"},{"key":"9295_CR6","volume-title":"Graphs and hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge C (1973) Graphs and hypergraphs. North-Holland\/Elsevier, Amsterdam"},{"key":"9295_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0012-365X(01)00073-5","volume":"244","author":"RC Brewster","year":"2002","unstructured":"Brewster RC, Hell P (2002) Homomorphsims to powers of digraphs. Discrete Math 244:31\u201341","journal-title":"Discrete Math"},{"key":"9295_CR8","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) Acylic 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":"9295_CR9","first-page":"239","volume":"73","author":"C Eslahchi","year":"2004","unstructured":"Eslahchi C, Rafiey A (2004) Circular chromatic number of hypergraphs. Ars Comb 73:239\u2013246","journal-title":"Ars Comb"},{"key":"9295_CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","volume":"131","author":"A Frank","year":"2003","unstructured":"Frank A, Kir\u00e1ly T, Kir\u00e1ly Z (2003) On the orientation of graphs and hypergraphs. Discrete Appl Math 131:385\u2013400","journal-title":"Discrete Appl Math"},{"key":"9295_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(86)90219-0","volume":"62","author":"P Frankl","year":"1986","unstructured":"Frankl P (1986) What must be contained in every oriented k-uniform hypergraphs. Discrete Math 62:311\u2013313","journal-title":"Discrete Math"},{"key":"9295_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/(SICI)1097-0118(199807)28:3<155::AID-JGT5>3.0.CO;2-J","volume":"28","author":"LA Goddyn","year":"1998","unstructured":"Goddyn LA, Tarsi M, Zhang CQ (1998) On (k,d)-colorings and fractional nowhere-zero flows. J Graph Theory 28:155\u2013161","journal-title":"J Graph Theory"},{"key":"9295_CR13","doi-asserted-by":"crossref","first-page":"623","DOI":"10.2307\/2310826","volume":"69","author":"GJ Minty","year":"1962","unstructured":"Minty GJ (1962) A theorem on n-coloring the points of a linear graph. Am Math Mon 69:623\u2013624","journal-title":"Am Math Mon"},{"key":"9295_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/jgt.10106","volume":"43","author":"B Mohar","year":"2003","unstructured":"Mohar B (2003) Circular colorings of edge-weighted graphs. J Graph Theory 43:107\u2013116","journal-title":"J Graph Theory"},{"key":"9295_CR15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(81)90011-X","volume":"34","author":"H M\u00fcller","year":"1981","unstructured":"M\u00fcller H (1981) Oriented hypergraphs, stability numbers and chromatic numbers. Discrete Math 34:319\u2013320","journal-title":"Discrete Math"},{"key":"9295_CR16","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/jgt.3190120411","volume":"12","author":"A Vince","year":"1988","unstructured":"Vince A (1988) Star chromatic number. J Graph Theory 12:551\u2013559","journal-title":"J Graph Theory"},{"key":"9295_CR17","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.tcs.2004.12.005","volume":"332","author":"H-G Yeh","year":"2005","unstructured":"Yeh H-G, Zhu X (2005) Resource-sharing system scheduling and circular chromatic number. Theor Comput Sci 332:447\u2013460","journal-title":"Theor Comput Sci"},{"key":"9295_CR18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X Zhu","year":"2001","unstructured":"Zhu X (2001) Circular chromatic number: a survey. Discrete Math 229:371\u2013410","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9295-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9295-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9295-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:15Z","timestamp":1559261895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9295-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9295"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9295-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,12]]}}}