{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T18:28:55Z","timestamp":1703010535468},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T00:00:00Z","timestamp":1633824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T00:00:00Z","timestamp":1633824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00816-z","type":"journal-article","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:31:18Z","timestamp":1633919478000},"page":"119-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On total and edge coloring some Kneser graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"C. M. H.","family":"de Figueiredo","sequence":"first","affiliation":[]},{"given":"C. S. R.","family":"Patr\u00e3o","sequence":"additional","affiliation":[]},{"given":"D.","family":"Sasaki","sequence":"additional","affiliation":[]},{"given":"M.","family":"Valencia-Pabon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,10]]},"reference":[{"key":"816_CR1","unstructured":"Baranyai Zs (1973)On the factorization of the complete uniform hypergraph. In A\u00a0Hajnal, R\u00a0Rado, and V\u00a0T S\u00f3s, editors, Infinite and Finite Sets, Proc Coll Keszthely, pages 91\u2013107, Colloquia Math. Soc. J\u00e1nos Bolyai, North-Holland, Amsterdam"},{"key":"816_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1112\/jlms\/s1-42.1.226","volume":"42","author":"M Behzad","year":"1967","unstructured":"Behzad M, Chartrand G, Cooper JK Jr (1967) The colour numbers of complete graphs. J London Math Soc 42:226\u2013228","journal-title":"J London Math Soc"},{"key":"816_CR3","doi-asserted-by":"crossref","unstructured":"Biggs NL (1979) Some odd graph theory. Second International Conference on Combinatorial Mathematics, Annals of the New York Academy of Sciences 319:71\u201381","DOI":"10.1111\/j.1749-6632.1979.tb32775.x"},{"key":"816_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P, Ko C, Rado R (1961) Intersection theorem for system of finite sets. Quart J Math 12:313\u2013318","journal-title":"Quart J Math"},{"key":"816_CR5","unstructured":"Fiorini S, Wilson RJ (1977) Edge-Colourings of Graphs. Research Notes in Math 16"},{"key":"816_CR6","volume-title":"Algebraic graph theory","author":"C Godsil","year":"2004","unstructured":"Godsil C, Royle G (2004) Algebraic graph theory, vol 207. Springer, New York"},{"key":"816_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven D, Galil Z (1983) NP-completeness of finding the chromatic index of regular graphs. J Algorithms 4:35\u201344","journal-title":"J Algorithms"},{"key":"816_CR8","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s10878-015-9897-3","volume":"32","author":"DD Liu","year":"2016","unstructured":"Liu DD, Zhu X (2016) A combinatorial proof for the circular chromatic number of Kneser graphs. J Comb Optim 32:765\u2013774","journal-title":"J Comb Optim"},{"key":"816_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz L (1978) Kneser\u2019s conjecture, chromatic numbers and homotopy. J Combin Theory (A) 25:319\u2013324","journal-title":"J Combin Theory (A)"},{"key":"816_CR10","unstructured":"Murthy TS (2021) A proof of the total coloring conjecture. ArXiv:2003.09658v3,"},{"key":"816_CR11","unstructured":"Prajnanaswaroopa S, Geetha J, Somasundaram K, Lin-Fu H, Narayanan N (2020) On total coloring of some classes of regular graphs ArXiv:1910.03922v4"},{"key":"816_CR12","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF02771690","volume":"9","author":"M Rosenfeld","year":"1971","unstructured":"Rosenfeld M (1971) On the total coloring of certain graphs. Israel J Math 9:396\u2013402","journal-title":"Israel J Math"},{"key":"816_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","volume":"78","author":"A S\u00e1nchez-Arroyo","year":"1989","unstructured":"S\u00e1nchez-Arroyo A (1989) Determining the total colouring number is NP-hard. Discrete Math 78:315\u2013319","journal-title":"Discrete Math"},{"key":"816_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.disc.2005.10.001","volume":"305","author":"M Valencia-Pabon","year":"2005","unstructured":"Valencia-Pabon M, Vera J (2005) On the diameter of Kneser graphs. Discrete Math 305:383\u2013385","journal-title":"Discrete Math"},{"key":"816_CR15","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a p-graph. Metody Diskret Analiz 3:25\u201330","journal-title":"Metody Diskret Analiz"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00816-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00816-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00816-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:28:07Z","timestamp":1659079687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00816-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["816"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00816-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,10]]},"assertion":[{"value":"24 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}