{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:43Z","timestamp":1740107143435,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00373-017-1866-4","type":"journal-article","created":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T15:03:48Z","timestamp":1513955028000},"page":"129-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Structure of Uniform One-Realizations of a Given Set"],"prefix":"10.1007","volume":"34","author":[{"given":"Ping","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Voloshin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefeng","family":"Diao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"1866_CR1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2298\/AADM0701036B","volume":"1","author":"Cs Bujt\u00e1s","year":"2007","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs: Color-bounded hypergraphs, III: model comparison. Appl. Anal. Discret. Math. 1, 36\u201355 (2007)","journal-title":"Appl. Anal. Discret. Math."},{"key":"1866_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-007-0765-5","volume":"24","author":"Cs Bujt\u00e1s","year":"2008","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs: Uniform mixed hypergraphs: the possible numbers of colors. Graphs Combin. 24, 1\u201312 (2008)","journal-title":"Graphs Combin."},{"key":"1866_CR3","doi-asserted-by":"crossref","first-page":"4890","DOI":"10.1016\/j.disc.2008.04.019","volume":"309","author":"Cs Bujt\u00e1s","year":"2009","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs: Color-bounded hypergraphs, I: general results. Discret. Math. 309, 4890\u20134902 (2009)","journal-title":"Discret. Math."},{"key":"1866_CR4","doi-asserted-by":"crossref","first-page":"6391","DOI":"10.1016\/j.disc.2008.10.023","volume":"309","author":"Cs Bujt\u00e1s","year":"2009","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs: Color-bounded hypergraphs, II: interval hypergraphs and hypertrees. Discret. Math. 309, 6391\u20136401 (2009)","journal-title":"Discret. Math."},{"key":"1866_CR5","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1016\/j.disc.2009.07.014","volume":"310","author":"Cs Bujt\u00e1s","year":"2010","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs: Color-bounded hypergraphs, IV: stable colorings of hypertrees. Discret. Math. 310, 1463\u20131474 (2010)","journal-title":"Discret. Math."},{"key":"1866_CR6","doi-asserted-by":"crossref","first-page":"1965","DOI":"10.1016\/j.disc.2012.09.020","volume":"313","author":"Cs Bujt\u00e1s","year":"2013","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs: Color-bounded hypergraphs, VI: structural and functional jumps in complexity. Discret. Math. 313, 1965\u20131977 (2013)","journal-title":"Discret. Math."},{"issue":"2","key":"1866_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.7151\/dmgt.1541","volume":"31","author":"Cs Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs, Voloshin, V.: Color-bounded hypergraphs, V: host graphs and subdivisions. Discussiones Mathematicae Graph Theory 31(2), 223\u2013238 (2011)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"1866_CR8","first-page":"230","volume-title":"Academic consultant: Bjarne Toft. Encyclopedia Math. Appl.","author":"Cs Bujt\u00e1s","year":"2015","unstructured":"Bujt\u00e1s, Cs, Tuza, Zs, Voloshin, V.: Hypergraph colouring. Topics in chromatic graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Academic consultant: Bjarne Toft. Encyclopedia Math. Appl., vol. 156, pp. 230\u2013254. Cambridge Univ. Press, Cambridge (2015)"},{"key":"1866_CR9","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":"1866_CR10","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":"1866_CR11","doi-asserted-by":"crossref","unstructured":"Diao, K., Voloshin, V., Xue, B., Zhao, P.: On perfection and imperfection of one-realizations of a given set. Discret. Math. (to appear)","DOI":"10.1016\/j.disc.2016.03.024"},{"key":"1866_CR12","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":"1866_CR13","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, D., K\u00e1ra, D. Kr\u00e1l, J., Pangr\u00e1c, O.: Pattern hypergraphs. Electron. J. Combin. 17, $$\\sharp $$ \u266f R15 (2010)","DOI":"10.37236\/287"},{"key":"1866_CR14","doi-asserted-by":"crossref","unstructured":"Kr\u00e1l, D.: On feasible sets of mixed hypergraphs. Electron. J. Combin. 11, $$\\sharp $$ \u266f R19 (2004)","DOI":"10.37236\/1772"},{"issue":"7\u20138","key":"1866_CR15","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":"1866_CR16","doi-asserted-by":"crossref","unstructured":"K\u00fcndgen, A., Mendelsohn, E., Voloshin, V.: Coloring of planar mixed hypergraphs. Electron. J. Combin. 7, $$\\sharp $$ \u266f R60 (2000)","DOI":"10.37236\/1538"},{"key":"1866_CR17","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":"1866_CR18","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":"1866_CR19","unstructured":"Tuza, Zs, Voloshin, V., Zhou, H.: Uniquely colorable mixed hypergraphs. Discret. Math. 248, 221\u2013236 (2002)"},{"key":"1866_CR20","first-page":"45","volume":"1","author":"V Voloshin","year":"1993","unstructured":"Voloshin, V.: The mixed hypergraphs. Comput. Sci. J. Moldova 1, 45\u201352 (1993)","journal-title":"Comput. Sci. J. Moldova"},{"key":"1866_CR21","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":"1866_CR22","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":"1866_CR23","unstructured":"Voloshin, V.: Mixed Hypergraph Coloring. http:\/\/spectrum.troy.edu\/voloshin\/mh.html"},{"key":"1866_CR24","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":"1866_CR25","doi-asserted-by":"publisher","unstructured":"Zhao, P., Diao, K., Lu, F.: More result on the smallest one-realization of a given set. Graphs Combin. https:\/\/doi.org\/10.1007\/s00373-015-1603-9","DOI":"10.1007\/s00373-015-1603-9"},{"key":"1866_CR26","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":"1866_CR27","doi-asserted-by":"crossref","unstructured":"Zhao, P., Diao, K., Wang, K.: The smallest one-realization of a given set. Electron. J. Combin. 19, $$\\sharp $$ \u266f P19 (2012)","DOI":"10.1016\/j.disc.2012.06.004"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1866-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1866-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1866-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T19:45:49Z","timestamp":1603568749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1866-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1866"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1866-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}