{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T19:37:49Z","timestamp":1773949069588,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7747,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0012-365x(92)90588-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"39-48","source":"Crossref","is-referenced-by-count":49,"title":["A solution to a colouring problem of P. Erd\u0151s"],"prefix":"10.1016","volume":"101","author":[{"given":"Herbert","family":"Fleischner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90588-7_BIB1","unstructured":"N. Alon and M. Tarsi, Colourings and orientations of graphs, Combinatorica, to appear."},{"key":"10.1016\/0012-365X(92)90588-7_BIB2","volume":"2","author":"Beineke","year":"1983"},{"key":"10.1016\/0012-365X(92)90588-7_BIB3","doi-asserted-by":"crossref","unstructured":"D.Z. Du, D.F. Hsu and F.K. Hwang, Hamiltonian property of consecutive-d digraphs, Comput. Math. Appl., to appear.","DOI":"10.1016\/0895-7177(93)90253-U"},{"key":"10.1016\/0012-365X(92)90588-7_BIB4","unstructured":"D.Z. Du and D.F. Hsu, On a combinatorial problem related to network design and optimization, manuscript."},{"key":"10.1016\/0012-365X(92)90588-7_BIB5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0403018","article-title":"Transversals of vertex partitions of graphs","volume":"3","author":"Fellows","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(92)90588-7_BIB6","article-title":"Eularian Graphs and Related Topics, Part 1","volume":"Vol. 1","author":"Fleischner","year":"1991"},{"key":"10.1016\/0012-365X(92)90588-7_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(89)90201-X","article-title":"On the Penrose number of cubic diagrams","volume":"74","author":"Jaeger","year":"1989","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/0012-365X(92)90588-7_BIB8","first-page":"9","article-title":"Open problems","volume":"1","author":"West","year":"1991","journal-title":"SIAM Discrete Math. Newsletter"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92905887?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92905887?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:53Z","timestamp":1555136753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92905887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0012365X92905887"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90588-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}