{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T22:37:31Z","timestamp":1784846251818,"version":"3.55.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s00373-005-0619-y","type":"journal-article","created":{"date-parts":[[2005,10,25]],"date-time":"2005-10-25T13:35:17Z","timestamp":1130247317000},"page":"343-354","source":"Crossref","is-referenced-by-count":63,"title":["An Anti-Ramsey Theorem on Cycles"],"prefix":"10.1007","volume":"21","author":[{"given":"J.J.","family":"Montellano-Ballesteros","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Neumann-Lara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"619_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N.: On a conjecture of Erd\u00f6s, Simonovits and S\u00f3s concerning anti-Ramsey theorems, J. Graph Theory Vol. 7, 91\u201394 (1983)","DOI":"10.1002\/jgt.3190070112"},{"key":"619_CR2","doi-asserted-by":"crossref","unstructured":"Arocha, J.L., Bracho, J., Neumann-Lara, V.: On the minimum size of tight hypergraphs, J. Graph Theory 16 (4), 319\u2013326 (1992)","DOI":"10.1002\/jgt.3190160405"},{"key":"619_CR3","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Kapoor, S.F., Nordhaus, E.A.: Hamiltonian path graphs, J. Graph Theory 7, 419\u2013427 (1983)","DOI":"10.1002\/jgt.3190070406"},{"key":"619_CR4","unstructured":"Erd\u00f6s, P., Simonovits, M., S\u00f3s, V.T.: Anti-Ramsey theorems, Colloquia Mathematica Societatis J\u00e1nos Bolyai, 10. Infinite and finite sets, Keszthely (Hungary), (1973)"},{"key":"619_CR5","doi-asserted-by":"crossref","unstructured":"Faudree, R.J., Schelp, R.H.: Path connected graphs, Acta Math. Acad. Sci. Hungar. 25, 313\u2013319 (1974)","DOI":"10.1007\/BF01886090"},{"key":"619_CR6","doi-asserted-by":"crossref","unstructured":"Hendry, G.R.T.: On the hamiltonian path graph of a graph, J. Graph Theory, Vol. 11, No. 3, 373\u2013384 (1987)","DOI":"10.1002\/jgt.3190110312"},{"key":"619_CR7","doi-asserted-by":"crossref","unstructured":"Manoussakis, Y., Spyratos, M., Tuza, Zs., Voigt, M.: Minimal Colorings for Properly Colored Subgraphs, Graphs and Combinatorics 12, 345\u2013360 (1996)","DOI":"10.1007\/BF01858468"},{"key":"619_CR8","doi-asserted-by":"crossref","unstructured":"Montellano-Ballesteros, J.J., Neumann-Lara, V.: An Anti-Ramsey Theorem, Combinatorica 22 (3), 445\u2013449 (2002)","DOI":"10.1007\/s004930200023"},{"key":"619_CR9","doi-asserted-by":"crossref","unstructured":"Montellano-Ballesteros, J.J., Neumann-Lara, V.: A linear heterochromatic number of graphs, Graphs and Combinatorics, to appear","DOI":"10.1007\/s00373-003-0511-6"},{"key":"619_CR10","doi-asserted-by":"crossref","unstructured":"Simonovits, M., S\u00f3s, V.T.: On restricted colourings of Kn, Combinatorica 4(1), 101\u2013110 (1984)","DOI":"10.1007\/BF02579162"},{"key":"619_CR11","doi-asserted-by":"crossref","unstructured":"Sterboul, F.: Smallest 3-graphs having a 3-colored edge in every k-colouring, Discrete Math. 27, 205\u2013210 (1979)","DOI":"10.1016\/0012-365X(79)90111-0"},{"key":"619_CR12","doi-asserted-by":"crossref","unstructured":"Williamson, J.E.: Panconnected graphs II, Period. Math. Hungar. 8, 105\u2013116 (1977)","DOI":"10.1007\/BF02018497"},{"key":"619_CR13","doi-asserted-by":"crossref","unstructured":"Woodall, G.R.: Sufficient conditions for circuit graphs, Proc. London Math. Soc. 24(3), 739\u2013755 (1972)","DOI":"10.1112\/plms\/s3-24.4.739"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0619-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-005-0619-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0619-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:25Z","timestamp":1559055505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-005-0619-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0619-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}