{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:55:29Z","timestamp":1649202929302},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T00:00:00Z","timestamp":1437004800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003091","name":"NSF of Shandong Province","doi-asserted-by":"crossref","award":["2014ZRB019GU"],"award-info":[{"award-number":["2014ZRB019GU"]}],"id":[{"id":"10.13039\/501100003091","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["11301251"],"award-info":[{"award-number":["11301251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00373-015-1603-9","type":"journal-article","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T01:20:51Z","timestamp":1436923251000},"page":"835-850","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["More Result on the Smallest One-Realization of a Given Set"],"prefix":"10.1007","volume":"32","author":[{"given":"Ping","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefeng","family":"Diao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"1603_CR1","unstructured":"Bacs\u00f3, G., Tuza, Zs., Voloshin, V.: Unique colorings of bi-hypergraphs. Australas. J. Combin. 27, 33\u201345 (2003)"},{"key":"1603_CR2","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs., Tuza, Zs.: Uniform mixed hypergraphs: the possible numbers of colors. Graphs Combin. 24, 1\u201312 (2008)","DOI":"10.1007\/s00373-007-0765-5"},{"key":"1603_CR3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1007\/s00373-013-1322-z","volume":"30","author":"K Diao","year":"2014","unstructured":"Diao, K., Zhao, P., Wang, K.: The smallest one-realization of a given set III. Graphs Combin. 30, 875\u2013885 (2014)","journal-title":"Graphs Combin."},{"key":"1603_CR4","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.disc.2014.12.021","volume":"338","author":"K Diao","year":"2015","unstructured":"Diao, K., Voloshin, V., Wang, K., Zhao, P.: The smallest one-realization of a given set IV. Discrete Math 338, 712\u2013724 (2015)","journal-title":"Discrete Math"},{"key":"1603_CR5","doi-asserted-by":"crossref","unstructured":"Jaffe, A., Moscibroda, T., Sen, S.: On the price of equivocation in byzantine agreement. In Proceedings of the 2012 ACM symposium on Principles of distributed computing, pages 309\u2013318, ACM New York, NY, USA (2012)","DOI":"10.1145\/2332432.2332491"},{"key":"1603_CR6","doi-asserted-by":"crossref","unstructured":"Jiang, T., Mubayi, D., Tuza, Zs., Voloshin, V., West, D.: The chromatic spectrum of mixed hypergraphs. Graphs Combin. 18, 309\u2013318 (2002)","DOI":"10.1007\/s003730200023"},{"key":"1603_CR7","doi-asserted-by":"crossref","first-page":"#R19","DOI":"10.37236\/1772","volume":"11","author":"D Kr\u00e1l","year":"2004","unstructured":"Kr\u00e1l, D.: On feasible sets of mixed hypergraphs. Electron. J. Combin. 11, #R19 (2004)","journal-title":"Electron. J. Combin."},{"issue":"7\u20138","key":"1603_CR8","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1016\/j.disc.2005.11.050","volume":"307","author":"D Kr\u00e1l","year":"2007","unstructured":"Kr\u00e1l, D.: Mixed Hypergraphs and other coloring problems. Discrete Math. 307(7\u20138), 923\u2013938 (2007)","journal-title":"Discrete Math."},{"key":"1603_CR9","doi-asserted-by":"crossref","first-page":"#R60","DOI":"10.37236\/1538","volume":"7","author":"A K\u00fcndgen","year":"2000","unstructured":"K\u00fcndgen, A., Mendelsohn, E., Voloshin, V.: Coloring of planar mixed hypergraphs. Electronic J. Combin. 7, #R60 (2000)","journal-title":"Electronic J. Combin."},{"key":"1603_CR10","first-page":"25","volume":"11","author":"V Voloshin","year":"1995","unstructured":"Voloshin, V.: On the upper chromatic number of a hypergraph. Australas. J. Combin. 11, 25\u201345 (1995)","journal-title":"Australas. J. Combin."},{"key":"1603_CR11","doi-asserted-by":"crossref","unstructured":"Voloshin, V.: Coloring mixed hypergraphs: theory, algorithms and applications. AMS, Providence (2002)","DOI":"10.1090\/fim\/017"},{"key":"1603_CR12","unstructured":"Voloshin, V.: Mixed Hypergraph Coloring Web Site: http:\/\/spectrum.troy.edu\/voloshin\/mh.html"},{"key":"1603_CR13","doi-asserted-by":"crossref","first-page":"#P19","DOI":"10.37236\/1171","volume":"19","author":"P Zhao","year":"2012","unstructured":"Zhao, P., Diao, K., Wang, K.: The smallest one-realization of a given set. Electron. J. Combin. 19, #P19 (2012)","journal-title":"Electron. J. Combin."},{"key":"1603_CR14","doi-asserted-by":"crossref","first-page":"2650","DOI":"10.1016\/j.disc.2011.08.007","volume":"311","author":"P Zhao","year":"2011","unstructured":"Zhao, P., Diao, K., Wang, K.: The chromatic spectrum of 3-uniform bi-hypergraphs. Discrete Math. 311, 2650\u20132656 (2011)","journal-title":"Discrete Math."},{"key":"1603_CR15","doi-asserted-by":"crossref","first-page":"2946","DOI":"10.1016\/j.disc.2012.06.004","volume":"312","author":"P Zhao","year":"2012","unstructured":"Zhao, P., Diao, K., Chang, R., Wang, K.: The smallest one-realization of a given set II. Discrete Math. 312, 2946\u20132951 (2012)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1603-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1603-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1603-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T01:20:19Z","timestamp":1599268819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1603-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,16]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["1603"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1603-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,16]]}}}