{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:56:17Z","timestamp":1649102177555},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0166-218x(99)00123-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"23-38","source":"Crossref","is-referenced-by-count":0,"title":["On the strong chromatic index of cyclic multigraphs"],"prefix":"10.1016","volume":"99","author":[{"given":"Pavol","family":"Gvozdjak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Hor\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz","family":"Meszka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zdzislaw","family":"Skupie\u0144","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00123-7_BIB1","unstructured":"L.D. Andersen, The strong chromatic index of a cubic graph is at most 10, in: J. Ne\u0161et\u0159il (Ed.), Topological, Algebraical and Combinatorial Structures; Frolik's Memorial Volume. Discrete Math. 108 (1992) 231\u2013252; reprinted in Vol. 8 of Topics in Discrete Math., Elsevier, Amsterdam, 1993."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB2","unstructured":"C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","article-title":"Problems and results in combinatorial analysis and graph theory","volume":"72","author":"Erd\u0151s","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB4","unstructured":"P. Erd\u0151s, J. Ne\u0161et\u0159il [Problem], in: G. Hal\u00e1sz, V.T. S\u00f3s (Eds.), Irregularities of Partitions, Springer, Berlin, 1989, pp. 162\u2013163."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","article-title":"Induced Matchings in Bipartite Graphs","volume":"78","author":"Faudree","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB6","first-page":"205","article-title":"The strong chromatic index of graphs","volume":"29","author":"Faudree","year":"1990","journal-title":"Ars Combin. B"},{"key":"10.1016\/S0166-218X(99)00123-7_BIB7","first-page":"141","article-title":"Strong edge-colourings of graphs and applications to multi-k-gons","volume":"16","author":"Fouquet","year":"1983","journal-title":"Ars Combin. A"},{"key":"10.1016\/S0166-218X(99)00123-7_BIB8","unstructured":"J.L. Fouquet, J.L. Jolivet, Strong Edge-colouring of Cubic Planar Graphs, Progress in Graph Theory (Waterloo, Ont., 1982), pp. 247\u2013264; Academic Press, Toronto, Ont., 1984."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB9","unstructured":"P. Gvozdjak, P. Hor\u00e1k, M. Meszka, Z. Skupie\u0144, Strong chromatic index for multigraphs, submitted for publication."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/jgt.3190170204","article-title":"Induced matchings in cubic graphs","volume":"17","author":"Hor\u00e1k","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(99)00123-7_BIB11","unstructured":"F. Kramer, H. Kramer, Ein Faerbungsproblem der Knotenpunkte eines Graphen bezueglich der Distanz p, Rev. Roum. Math. Pur. Appl. 14 (1969) 1031\u20131038 (in German)."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB12","unstructured":"F. Kramer, H. Kramer, Un probleme de coloration des sommets d'un graphe C. R. Acad. Sci. Paris Ser. A 268 (1969) 46\u201348 (in French)."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB13","unstructured":"M. Meszka, Edge decompositions of combinatorial structures and related topics, Ph.D. Thesis, Jagiellonian University, Cracow, 1998 (in Polish)."},{"key":"10.1016\/S0166-218X(99)00123-7_BIB14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.7151\/dmgt.1010","article-title":"Some maximum multigraphs and edge\/vertex distance colourings","volume":"15","author":"Skupie\u0144","year":"1995","journal-title":"Discuss. Math. \u2014 Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:55:14Z","timestamp":1556132114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0166218X99001237"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00123-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}