{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T02:44:03Z","timestamp":1780541043615,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T00:00:00Z","timestamp":1495584000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301251"],"award-info":[{"award-number":["11301251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671186"],"award-info":[{"award-number":["11671186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003091","name":"Shandong Province","doi-asserted-by":"publisher","award":["2014ZRB019GU"],"award-info":[{"award-number":["2014ZRB019GU"]}],"id":[{"id":"10.13039\/501100003091","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1810-7","type":"journal-article","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T12:17:58Z","timestamp":1495628278000},"page":"869-883","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set"],"prefix":"10.1007","volume":"33","author":[{"given":"Kefeng","family":"Diao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vitaly","family":"Voloshin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ping","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"1810_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s004930100000","volume":"21","author":"M Axenovich","year":"2001","unstructured":"Axenovich, M., K\u00fcndgen, A.: On a generalized anti-Ramsey problem. Combinatorica 21, 335\u2013349 (2001)","journal-title":"Combinatorica"},{"key":"1810_CR2","doi-asserted-by":"crossref","first-page":"4890","DOI":"10.1016\/j.disc.2008.04.019","volume":"309","author":"C Bujt\u00e1s","year":"2009","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Color-bounded hypergraphs, I: general results. Discret. Math. 309, 4890\u20134902 (2009)","journal-title":"Discret. Math."},{"key":"1810_CR3","doi-asserted-by":"crossref","first-page":"6391","DOI":"10.1016\/j.disc.2008.10.023","volume":"309","author":"C Bujt\u00e1s","year":"2009","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Color-bounded hypergraphs, II: interval hypergraphs and hypertrees. Discret. Math. 309, 6391\u20136401 (2009)","journal-title":"Discret. Math."},{"key":"1810_CR4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2298\/AADM0701036B","volume":"1","author":"C Bujt\u00e1s","year":"2007","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Color-bounded hypergraphs, III: model comparison. Appl. Anal. Discret. Math. 1, 36\u201355 (2007)","journal-title":"Appl. Anal. Discret. Math."},{"key":"1810_CR5","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1016\/j.disc.2009.07.014","volume":"310","author":"C Bujt\u00e1s","year":"2010","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Color-bounded hypergraphs, IV: stable colorings of hypertrees. Discret. Math. 310, 1463\u20131474 (2010)","journal-title":"Discret. Math."},{"issue":"2","key":"1810_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.7151\/dmgt.1541","volume":"31","author":"C Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s, C., Tuza, Z., Voloshin, V.: Color-bounded hypergraphs, V: host graphs and subdivisions. Discuss. Math. Graph Theory 31(2), 223\u2013238 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1810_CR7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/S0166-218X(97)89209-8","volume":"77","author":"E Bulgaru","year":"1997","unstructured":"Bulgaru, E., Voloshin, V.: Mixed interval hypergraphs. Discret. Appl. Math. 77, 24\u201341 (1997)","journal-title":"Discret. Appl. Math."},{"key":"1810_CR8","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.disc.2005.12.020","volume":"306","author":"K Diao","year":"2006","unstructured":"Diao, K., Liu, G., Rautenbach, D., Zhao, P.: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discret. Math. 306, 670\u2013672 (2006)","journal-title":"Discret. Math."},{"key":"1810_CR9","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. Discret. Math. 338, 712\u2013724 (2015)","journal-title":"Discret. Math."},{"key":"1810_CR10","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 Comb. 30, 875\u2013885 (2014)","journal-title":"Graphs Comb."},{"key":"1810_CR11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0012-365X(99)00382-9","volume":"220","author":"K Diao","year":"2000","unstructured":"Diao, K., Zhao, P., Zhou, H.: About the upper chromatic number of a co-hypergraph. Discret. Math. 220, 249\u2013259 (2000)","journal-title":"Discret. Math."},{"issue":"12","key":"1810_CR12","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.aml.2007.02.006","volume":"20","author":"E Drgas-Burchardt","year":"2007","unstructured":"Drgas-Burchardt, E., \u0141azuka, E.: On chromatic polynomials of hypergraphs. Appl. Math. Lett. 20(12), 1250\u20131254 (2007)","journal-title":"Appl. Math. Lett."},{"key":"1810_CR13","doi-asserted-by":"crossref","first-page":"R15","DOI":"10.37236\/287","volume":"17","author":"D Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k, D., K\u00e1ra, J., Kr\u00e1l, D., Pangr\u00e1c, O.: Pattern hypergraphs. Electron. J. Combin 17, R15 (2010)","journal-title":"Electron. J. Combin"},{"key":"1810_CR14","doi-asserted-by":"crossref","unstructured":"Jaffe, A., Moscibroda, T., Sen, S.: On the price of equivocation in byzantine agreement. In: Proc. 31st Principles of Distributed Computing (PODC) (2012)","DOI":"10.1145\/2332432.2332491"},{"key":"1810_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s003730200022","volume":"18","author":"T Jiang","year":"2002","unstructured":"Jiang, T.: Edge-colorings with no large polychromatic stars. Graphs Comb. 18, 303\u2013308 (2002)","journal-title":"Graphs Comb."},{"key":"1810_CR16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s003730200023","volume":"18","author":"T Jiang","year":"2002","unstructured":"Jiang, T., Mubayi, D., Tuza, Zs, Voloshin, V., West, D.: The chromatic spectrum of mixed hypergraphs. Graphs Comb. 18, 309\u2013318 (2002)","journal-title":"Graphs Comb."},{"key":"1810_CR17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.disc.2003.09.002","volume":"274","author":"T Jiang","year":"2004","unstructured":"Jiang, T., West, D.: Edge-colorings of complete graphs that avoid polychromatic trees. Discret. Math. 274, 137\u2013145 (2004)","journal-title":"Discret. Math."},{"key":"1810_CR18","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1017\/S096354830300590X","volume":"12","author":"T Jiang","year":"2003","unstructured":"Jiang, T., West, D.: On the Erd\u0151s-Simonovits-S\u00f3s conjecture about the anti-Ramsey number of a cycle. Comb. Probab. Comput. 12, 585\u2013598 (2003)","journal-title":"Comb. Probab. Comput."},{"key":"1810_CR19","doi-asserted-by":"crossref","first-page":"N3","DOI":"10.37236\/1588","volume":"3","author":"D Kobler","year":"2001","unstructured":"Kobler, D., K\u00fcndgen, A.: Gaps in the chromatic spectrum of faced-constrained palne graphs. Electron. J. Comb. 3, N3 (2001)","journal-title":"Electron. J. Comb."},{"key":"1810_CR20","first-page":"253","volume":"27","author":"D Kr\u00e1l","year":"2003","unstructured":"Kr\u00e1l, D.: A counter-example to Voloshin\u2019s hypergraphs co-perfectness conjecture. Australas. J. Comb. 27, 253\u2013262 (2003)","journal-title":"Australas. J. Comb."},{"key":"1810_CR21","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. Comb. 11, R19 (2004)","journal-title":"Electron. J. Comb."},{"issue":"7\u20138","key":"1810_CR22","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. Discret. Math. 307(7\u20138), 923\u2013938 (2007)","journal-title":"Discret. Math."},{"key":"1810_CR23","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. Electron. J. Comb. 7, R60 (2000)","journal-title":"Electron. J. Comb."},{"key":"1810_CR24","first-page":"25","volume":"11","author":"V Voloshin","year":"1995","unstructured":"Voloshin, V.: On the upper chromatic number of a hypergraph. Australas. J. Comb. 11, 25\u201345 (1995)","journal-title":"Australas. J. Comb."},{"key":"1810_CR25","volume-title":"Coloring Mixed Hypergraphs: Theory, Algorithms and Applications","author":"V Voloshin","year":"2002","unstructured":"Voloshin, V.: Coloring Mixed Hypergraphs: Theory, Algorithms and Applications. AMS, Providence (2002)"},{"key":"1810_CR26","unstructured":"Voloshin, V.: Mixed Hypergraph Coloring Web Site: http:\/\/spectrum.troy.edu\/voloshin\/mh.html"},{"key":"1810_CR27","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. Discret. Math. 312, 2946\u20132951 (2012)","journal-title":"Discret. Math."},{"key":"1810_CR28","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. Discret. Math. 311, 2650\u20132656 (2011)","journal-title":"Discret. Math."},{"key":"1810_CR29","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"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1810-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1810-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1810-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T11:06:55Z","timestamp":1602155215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1810-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,24]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1810"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1810-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,24]]}}}