{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T08:06:28Z","timestamp":1767513988798},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T00:00:00Z","timestamp":1386374400000},"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-1382-0","type":"journal-article","created":{"date-parts":[[2013,12,6]],"date-time":"2013-12-06T10:48:20Z","timestamp":1386326900000},"page":"265-280","source":"Crossref","is-referenced-by-count":3,"title":["Orientations of Graphs with Prescribed Weighted Out-Degrees"],"prefix":"10.1007","volume":"31","author":[{"given":"Michael","family":"Stiebitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margit","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,7]]},"reference":[{"key":"1382_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N.: Restricted colorings of graphs. In: London Mathematical Society. Lecture Notes Series, vol. 187, pp. 1\u201333. Cambride University Press, Cambride (1993)","DOI":"10.1017\/CBO9780511662089.002"},{"key":"1382_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N. Alon","year":"1992","unstructured":"Alon N., Tarsi M.: Colorings and orientations of graphs. Combinatorica 12, 125\u2013134 (1992)","journal-title":"Combinatorica"},{"key":"1382_CR3","unstructured":"Bondy, J.A., Boppana, R., Siegel, A.: Unpublished (1989)"},{"key":"1382_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks R.L.: On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"1382_CR5","unstructured":"Chv\u00e1tal, V.: On the computational complexity of finding a kernel. Report No. CRM-300, Centre de Recherches Mathematiques, Universite de Motreal (1973)"},{"key":"1382_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s P., Hajnal A.: On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hung. 17, 61\u201399 (1966)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1382_CR7","first-page":"125","volume":"XXVI","author":"P. Erd\u0151s","year":"1979","unstructured":"Erd\u0151s P., Rubin A.L., Taylor H.: Choosability in graphs. Congr. Numer. XXVI, 125\u2013157 (1979)","journal-title":"Congr. Numer."},{"key":"1382_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(92)90588-7","volume":"101","author":"H. Fleischner","year":"1992","unstructured":"Fleischner H., Stiebitz M.: A solution to a colouring problem of P. Erd\u0151s. Discrete Math. 101, 39\u201348 (1992)","journal-title":"Erd\u0151s. Discrete Math."},{"key":"1382_CR9","unstructured":"Frank, A., Gy\u00e1rfas, A.: How to orient a graph? In: Combinatorics (Proc. 5th Hung. Colloq., Keszthely, 1976), vol. 1. Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 18, pp. 353\u2013364. North-Holland, Amsterdam (1978)"},{"key":"1382_CR10","unstructured":"Frank, A.: Connectivity and network flows. In: Handbook of Combinatorics, vol. I. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L., (eds.) North-Holland, Amsterdam, pp. 111\u2013178 (1995)"},{"key":"1382_CR11","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson D.R., Gross O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"1382_CR12","unstructured":"Gallai, T.: Kritische Graphen I, II. Publ. Math. Inst. Hungar. Acad. Sci. 8, 165\u2013192 and 373\u2013395 (1963)"},{"key":"1382_CR13","unstructured":"Gallai, T.: On directed paths and circuits. In: Erd\u0151s, P., Katona, G. (eds.) Theory of Graphs Proc. Colloqu., Tihany, 1966. Academic Press, New York, pp. 115\u2013118 (1968)"},{"key":"1382_CR14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F. Galvin","year":"1995","unstructured":"Galvin F.: The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B 63, 153\u2013158 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1382_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S.L. Hakimi","year":"1965","unstructured":"Hakimi S.L.: On the degrees of the vertices of a digraph. J. Frankl. Inst. 279, 290\u2013308 (1965)","journal-title":"J. Frankl. Inst."},{"key":"1382_CR16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"1382_CR17","doi-asserted-by":"crossref","unstructured":"Hasse, M.: Zur algebraischen Begr\u00fcndung der Graphentheorie I. Math. Nachr. 28, 275\u2013290 (1964\/1965)","DOI":"10.1002\/mana.19650280503"},{"key":"1382_CR18","doi-asserted-by":"crossref","first-page":"3426","DOI":"10.1016\/j.disc.2010.07.019","volume":"310","author":"J. Hladk\u00fd","year":"2010","unstructured":"Hladk\u00fd J., Kr\u00e1l\u2019 D., Schauz U.: Brooks theorem via the Alon-Tarsi-theorem. Discrete Math. 310, 3426\u20133428 (2010)","journal-title":"Discrete Math."},{"key":"1382_CR19","doi-asserted-by":"crossref","unstructured":"Kratochv\u00ed l, J., Tuza, Z., Voigt, M.: New trends in the theory of graph colorings: choosability and list coloring In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 183\u2013 197. American Mathematical Society (1999)","DOI":"10.1090\/dimacs\/049\/13"},{"key":"1382_CR20","unstructured":"Lov\u00e1sz, L.: Perfect graphs. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 2, pp. 55\u201388. Academic Press, New York (1983)"},{"key":"1382_CR21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","volume":"13","author":"M. Middendorf","year":"1993","unstructured":"Middendorf M., Pfeiffer F.: On the complexity of the disjoint paths problem. Combinatorica 13, 97\u2013107 (1993)","journal-title":"Combinatorica"},{"key":"1382_CR22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00373-002-0486-8","volume":"19","author":"A. Prowse","year":"2003","unstructured":"Prowse A., Woodall D.R.: Choosability of powers of circuits. Graphs Combin. 19, 137\u2013144 (2003)","journal-title":"Graphs Combin."},{"key":"1382_CR23","doi-asserted-by":"crossref","first-page":"573","DOI":"10.2307\/1969755","volume":"58","author":"M. Richardson","year":"1953","unstructured":"Richardson M.: Solutions of irreflexive relations. Ann. Math. 58, 573\u2013580 (1953)","journal-title":"Ann. Math."},{"key":"1382_CR24","first-page":"129","volume":"1","author":"B. Roy","year":"1967","unstructured":"Roy B.: Nombre chromatique et plus longs chemins d\u2019un graphe. Rev. Francaise Informat. Recherche Op\u00e9rationelle 1, 129\u2013132 (1967)","journal-title":"Rev. Francaise Informat. Recherche Op\u00e9rationelle"},{"key":"1382_CR25","unstructured":"Tesman, B.: T-colorings, list T-colorings, and set T-colorings of graphs. Ph.D. Thesis, Rutgers University, New Brunswick, New Jersey (1989)"},{"key":"1382_CR26","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0095-8956(92)90042-V","volume":"55","author":"Z. Tuza","year":"1992","unstructured":"Tuza Z.: Graph coloring in linear time. J. Combin. Theory Ser. B 55, 236\u2013243 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1382_CR27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z. Tuza","year":"1997","unstructured":"Tuza Z.: Graph colorings with local constraints\u2014a survey. Discuss. Math. Graph Theory 17, 161\u2013228 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1382_CR28","first-page":"69","volume":"9","author":"Z. Tuza","year":"1996","unstructured":"Tuza Z., Voigt M.: On a conjecture of Erd\u0151s, Rubin and Taylor. Tatra Mt. Math. Publ. 9, 69\u201382 (1996)","journal-title":"Tatra Mt. Math. Publ."},{"key":"1382_CR29","unstructured":"Vizing, V.G.: Colouring the vertices of a graph in prescribed colours (in Russian) Metody Diskret. Diskret. Analiz. No 29, Metody Diskret. Anal. v Teorii Kodov i Skhem, vol. 101, pp. 3\u201310 (1976)"},{"key":"1382_CR30","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0012-365X(98)00297-0","volume":"202","author":"D.R. Woodall","year":"1999","unstructured":"Woodall D.R.: Edge-choosability of multicircuits. Discrete Math. 202, 271\u2013277 (1999)","journal-title":"Discrete Math."},{"key":"1382_CR31","unstructured":"Woodall, D.R.: List colourings of graphs. In: London Mathematical Society. Lecture Notes Series, vol. 288, pp. 1\u201333. Cambride University Press, Cambride (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1382-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1382-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1382-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T15:26:27Z","timestamp":1564932387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1382-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,7]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1382"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1382-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,7]]}}}