{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T07:29:31Z","timestamp":1773991771748,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T00:00:00Z","timestamp":1386806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00373-013-1381-1","type":"journal-article","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T10:31:11Z","timestamp":1386757871000},"page":"91-98","source":"Crossref","is-referenced-by-count":13,"title":["On Weak Chromatic Polynomials of Mixed Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Matthias","family":"Beck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Blado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ta\u00efna","family":"Jean-Louis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,12]]},"reference":[{"key":"1381_CR1","doi-asserted-by":"crossref","first-page":"P42","DOI":"10.37236\/2741","volume":"19","author":"M. Beck","year":"2012","unstructured":"Beck M., Bogart T., Pham T.: Enumeration of Golomb rulers and acyclic orientations of mixed graphs. Electron. J. Comb. 19, P42 (2012)","journal-title":"Electron. J. Comb."},{"issue":"12","key":"1381_CR2","doi-asserted-by":"crossref","first-page":"4027","DOI":"10.1016\/j.disc.2008.11.033","volume":"309","author":"H. Furma\u0144czyk","year":"2009","unstructured":"Furma\u0144czyk H., Kosowski A., Ries B., \u00a0Zyli\u0144ski P.: Mixed graph edge coloring. Discret. Math. 309(12), 4027\u20134036 (2009)","journal-title":"Discret. Math."},{"issue":"1","key":"1381_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01194253","volume":"45","author":"P. Hansen","year":"1997","unstructured":"Hansen P., Kuplinsky J., de Werra D.: Mixed graph colorings. Math. Methods Oper. Res. 45(1), 145\u2013160 (1997)","journal-title":"Math. Methods Oper. Res."},{"key":"1381_CR4","doi-asserted-by":"crossref","unstructured":"Kotek, T.; Makowsky, J.A.; Zilber, B.: On counting generalized colorings. In: Computer science logic. Lecture Notes in Computer Science, vol. 5213, pp. 339\u2013353. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-87531-4_25"},{"key":"1381_CR5","unstructured":"Sotskov, Y.N.; Tanaev, V.S.: Chromatic polynomial of a mixed graph. Vesc\u012b Akad. Navuk BSSR Ser. F\u012bz.-Mat. Navuk 140(6):20\u201323 (1976)"},{"issue":"3","key":"1381_CR6","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/0233193021000004994","volume":"51","author":"Y.N. Sotskov","year":"2002","unstructured":"Sotskov Y.N., Tanaev V.S., Werner F.: Scheduling problems and mixed graph colorings. Optimization 51(3), 597\u2013624 (2002)","journal-title":"Optimization"},{"key":"1381_CR7","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Ordered structures and partitions. In: American Mathematical Society, Providence, R.I. Memoirs of the American Mathematical Society, No. 119 (1972)","DOI":"10.1090\/memo\/0119"},{"key":"1381_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","volume":"5","author":"R.P. Stanley","year":"1973","unstructured":"Stanley R.P.: Acyclic orientations of graphs. Discret. Math. 5, 171\u2013178 (1973)","journal-title":"Discret. Math."},{"key":"1381_CR9","unstructured":"Stanley, R.P.: Enumerative combinatorics. volume 1, volume 49 of Cambridge studies in advanced mathematics. In: Cambridge University Press, 2nd edn. Cambridge (2012)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1381-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1381-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1381-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T23:03:07Z","timestamp":1597186987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1381-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,12]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1381"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1381-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,12]]}}}