{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:25Z","timestamp":1759063645373},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"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":[[1982,3]]},"DOI":"10.1007\/bf02579280","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:17:40Z","timestamp":1174601860000},"page":"37-51","source":"Crossref","is-referenced-by-count":10,"title":["Canonical edge-colourings of locally finite graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"A. J. W.","family":"Hilton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579280_CR1","unstructured":"J. Akiyama, G. Exco andF. Harary, Covering and packing in graphs III. Cyclic and acyclic invariants,Math. Slovaca, to appear."},{"key":"BF02579280_CR2","doi-asserted-by":"crossref","first-page":"272","DOI":"10.21136\/CMJ.1972.101098","volume":"22","author":"J. Bos\u00e1k","year":"1972","unstructured":"J. Bos\u00e1k, Chromatic index of finite and infinite graphs,Czechoslovak Math. J. 22 (1972), 272\u2013290.","journal-title":"Czechoslovak Math. J."},{"key":"BF02579280_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/net.3230040307","volume":"4","author":"D. P. Geller","year":"1974","unstructured":"D. P. Geller andA. J. W. Hilton, How to colour the lines of a bigraph,Networks 4 (1974), 281\u2013282.","journal-title":"Networks"},{"key":"BF02579280_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1112\/jlms\/s2-12.1.123","volume":"12","author":"A. J. W. Hilton","year":"1975","unstructured":"A. J. W. Hilton, Colouring the edges of a multigraph so that each vertex has at mostj, or at leastj, edges of each colour on it,J. London Math. Soc. (2),12 (1975), 123\u2013128.","journal-title":"J. London Math. Soc. (2)"},{"key":"BF02579280_CR5","volume-title":"Theorie der endlichen und unendlichen Graphen","author":"D. K\u00f6nig","year":"1950","unstructured":"D. K\u00f6nig,Theorie der endlichen und unendlichen Graphen, Chelsea Pub. Co. New York (1950)."},{"key":"BF02579280_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.4153\/CJM-1949-031-1","volume":"1","author":"R. Rado","year":"1949","unstructured":"R. Rado, Axiomatic treatment of rank in infinite sets,Can. J. of Math. 1 (1949), 337\u2013343.","journal-title":"Can. J. of Math."},{"key":"BF02579280_CR7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0097-3165(71)90021-5","volume":"10","author":"R. Rado","year":"1971","unstructured":"R. Rado, A selection lemma,J. Combinatorial Theory,10 (1971), 176\u2013177.","journal-title":"J. Combinatorial Theory"},{"key":"BF02579280_CR8","unstructured":"P. Tomasta, Note on linear arboricity,Math. Slovaca, to appear."},{"key":"BF02579280_CR9","first-page":"25","volume":"3","author":"V. G. Vizing","year":"1964","unstructured":"V. G. Vizing, On an estimate of the chromatic class of ap-graph,Diskret. Analiz 3 (1964), 25\u201330.","journal-title":"Diskret. Analiz"},{"key":"BF02579280_CR10","first-page":"9","volume":"5","author":"V. G. Vizing","year":"1965","unstructured":"V. G. Vizing, Critical graphs with a given chromatic class,Diskret. Analiz 5 (1965), 9\u201317.","journal-title":"Diskret. Analiz"},{"key":"BF02579280_CR11","doi-asserted-by":"crossref","unstructured":"D. de Werra, A few remarks on chromatic scheduling,Combinatorial Programming: Methods and Applications (B. Roy (ed.)), D. Reidel Pub. Co. (1975), 337\u2013342.","DOI":"10.1007\/978-94-011-7557-9_18"},{"key":"BF02579280_CR12","first-page":"309","volume":"32","author":"D. Werra de","year":"1979","unstructured":"D. de Werra, Partial compactness in chromatic scheduling,Proc. III Symposium on Operations Research (Heidelberg, Sept. 1978), Op. Res. Verfahren,32 (1979), 309\u2013316.","journal-title":"Op. Res. Verfahren"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579280.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579280\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T18:10:57Z","timestamp":1628705457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["BF02579280"],"URL":"https:\/\/doi.org\/10.1007\/bf02579280","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}