{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:49:50Z","timestamp":1773150590466,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf01303515","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T08:01:50Z","timestamp":1111737710000},"page":"435-440","source":"Crossref","is-referenced-by-count":12,"title":["Fractionally colouring total graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"K.","family":"Kilakos","sequence":"first","affiliation":[]},{"given":"B.","family":"Reed","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. Behzad: Graphs and their chromatic numbers,Doctoral Thesis (Michigan State University)., (1965)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Maximum matching and a polyhedron with 0,1 vertices,Journal of Research of the National Bureau of Standards (B) 69 (1965), 125?130.","journal-title":"Journal of Research of the National Bureau of Standards (B)"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D. R. Fulkerson","year":"1972","unstructured":"D. R. Fulkerson: Anti-blocking polyhedra,J. Combinatorial Theory B 12 (1972). 50?71.","journal-title":"J. Combinatorial Theory B"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01787726","volume":"6","author":"H. R. Hind","year":"1990","unstructured":"H. R. Hind: An upper bound on the total chromatic number.,Graphs and Combinatorics 6 (1990), 153?158.","journal-title":"Graphs and Combinatorics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(90)90073-L","volume":"27","author":"J. Ryan","year":"1990","unstructured":"J. Ryan: Fractional total colouring,Discrete Appl. Math. 27 (1990), 287?292.","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"CR6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-3.3.405","volume":"3","author":"N. Vijayaditya","year":"1971","unstructured":"N. Vijayaditya: On the total chromatic number of a graph,J. London Math. Soc. (2)3 (1971), 405?408.","journal-title":"J. London Math. Soc."},{"key":"CR7","first-page":"117","volume":"23","author":"V. G. Vizing","year":"1968","unstructured":"V. G. Vizing: Some unsolved problems in graph theory (in Russian),Uspekhi Math. Nauk. 23 (1968), 117?134.","journal-title":"Uspekhi Math. Nauk."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303515.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01303515\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01303515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:46Z","timestamp":1556647726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01303515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01303515"],"URL":"https:\/\/doi.org\/10.1007\/bf01303515","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}