{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:42:00Z","timestamp":1780544520764,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf01261320","type":"journal-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T22:01:48Z","timestamp":1111615308000},"page":"343-352","source":"Crossref","is-referenced-by-count":30,"title":["List edge colourings of some 1-factorable multigraphs"],"prefix":"10.1007","volume":"16","author":[{"given":"M. N.","family":"Ellingham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis","family":"Goddyn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"N. Alon: Restricted colorings of graphs, in:?Surveys in Combinatorics?, Proc. 14th British Combinatorial Conference, London Mathematical Society Lecture Notes Series 187, edited by K. Walker, Cambridge University Press, 1993, 1?33.","DOI":"10.1017\/CBO9780511662089.002"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N. Alon","year":"1992","unstructured":"N. Alon, andM. Tarsi: Colorings and orientations of graphs,Combinatorica,12, (1992), 125?134.","journal-title":"Combinatorica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(89)90199-4","volume":"74","author":"B. Bollob\ufffds","year":"1989","unstructured":"B. Bollob\ufffds, andH. R. Hind: A new upper bound for the list chromatic number,Discrete Math.,74, (1989), 65?75.","journal-title":"Discrete Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190130112","volume":"13","author":"Amanda Chetwynd","year":"1989","unstructured":"Amanda Chetwynd, andRoland H\ufffdggkvist: A note on list-colorings,J. Graph Theory,13 (1989), 87?95.","journal-title":"J. Graph Theory"},{"key":"CR5","first-page":"125","volume":"26","author":"P. Erd?s","year":"1979","unstructured":"P. Erd?s, A. Rubin, andH. Taylor: Choosability in graphs,Congr. Numer.,26, (1979), 125?157.","journal-title":"Congr. Numer."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(92)90588-7","volume":"101","author":"H. Fleischner","year":"1992","unstructured":"H. Fleischner, andM. Stiebitz: A solution to a colouring problem of P. Erd?s,Discrete Math,101, (1992), 39?48.","journal-title":"Discrete Math"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F. Galvin","year":"1995","unstructured":"F. Galvin: The list chromatic index of a bipartite multigraph,J. Combin. Theory, Ser. B,63 (1995), 153?159.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"CR8","unstructured":"R. H\ufffdggkvist, andJ. Janssen: New bounds on the list-chromatic index of the complete graph,Combin. Probab. Comput, to appear."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(89)90201-X","volume":"74","author":"F. Jaeger","year":"1989","unstructured":"F. Jaeger: On the Penrose number of cubic diagrams,Discrete Math.,74 (1989), 85?97.","journal-title":"Discrete Math."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02579177","volume":"1","author":"S.-Y. R. Li","year":"1981","unstructured":"S.-Y. R. Li, andW.-C. W. Li: Independence numbers of graphs and generators of ideals,Combinatorica,1 (1981), 55?61.","journal-title":"Combinatorica"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"Julius Petersen","year":"1891","unstructured":"Julius Petersen: Die Theorie der regul\ufffdren graphs,Acta Math.,15 (1891), 193?220.","journal-title":"Acta Math."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0012-365X(92)90607-H","volume":"101","author":"G. Sabidussi","year":"1992","unstructured":"G. Sabidussi: Binary invariants and orientations of graphs,Discrete Math.,101 (1992), 251?277.","journal-title":"Discrete Math."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0012-365X(74)90157-5","volume":"8","author":"David E. Scheim","year":"1974","unstructured":"David E. Scheim: The number of edge 3-colorings of a planar cubic graph as a permanent,Discrete Math.,8 (1974), 377?382.","journal-title":"Discrete Math."},{"key":"CR14","unstructured":"P. D. Seymour: Some unsolved problems on one-factorizations of graphs,Graph Theory and Related Topics, edited by J. A. Bondy and U. S. R. Murty, Academic Press (1979) 367?368."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/jgt.3190060218","volume":"6","author":"Andrew Thomason","year":"1982","unstructured":"Andrew Thomason: Cubic graphs with three hamiltonian cycles are not always uniquely edge colourable,J. Graph Theory,6 (1982), 219?221.","journal-title":"J. Graph Theory"},{"key":"CR16","first-page":"770","volume":"223","author":"L. Vigneron","year":"1946","unstructured":"L. Vigneron: Remarques sur les r\ufffdseaux cubiques de classe 3 associ\ufffds au probl\ufffdme des quatre couleurs,C. R. Acad. Sc. Paris,223 (1946), 770?772.","journal-title":"C. R. Acad. Sc. Paris"},{"key":"CR17","first-page":"221","volume-title":"Combinatorial Mathematics and its Applications","author":"Roger Penrose","year":"1971","unstructured":"Roger Penrose: Applications of negative dimensional tensors, in:Combinatorial Mathematics and its Applications, Proc. Conf., Oxford, 1969. Academic Press, London, 1971, 221?244."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261320.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01261320\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:08:44Z","timestamp":1556795324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01261320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01261320"],"URL":"https:\/\/doi.org\/10.1007\/bf01261320","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}