{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,10]],"date-time":"2026-09-10T22:43:01Z","timestamp":1789080181878,"version":"build-2803163510"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501539"],"award-info":[{"award-number":["11501539"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11622110"],"award-info":[{"award-number":["11622110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601379"],"award-info":[{"award-number":["11601379"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let $G$ be a graph and $L(G)$ be the set of all odd cycle lengths of $G$. We prove that (1) if $L(G)=\\{3,3+2l\\}$, where $l\\geq 2$, then $\\chi(G)=\\max\\{3,\\omega(G)\\}$, and (2) if $L(G)=\\{k,k+2l\\}$, where $k\\geq 5$ and $l\\geq 1$, then $\\chi(G)=3$. These, together with the case $L(G)=\\{3,5\\}$ solved in [S.-S. Wang, SIAM J. Discrete Math., 22 (2008), pp. 1040--1072] give a complete solution to the general problem addressed in [S.-S. Wang, SIAM J. Discrete Math., 22 (2008), pp. 1040--1072; S.-M. Camacho and I. Schiermeyer, Discrete Math., 309 (2009), pp. 4916--4919; and T. Kaiser, O. Ruck\u00fd, and R. \u0160krekovski, SIAM J. Discrete Math., 25 (2011), pp. 1069--1088]. Our results also improve a classical theorem of Gy\u00e1rf\u00e1s which asserts that $\\chi(G)\\le 2|L(G)|+2$ for any graph $G$.<\/jats:p>","DOI":"10.1137\/15m1053773","type":"journal-article","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:24:31Z","timestamp":1517311471000},"page":"296-319","source":"Crossref","is-referenced-by-count":1,"title":["Coloring Graphs with Two Odd Cycle Lengths"],"prefix":"10.1137","volume":"32","author":[{"given":"Jie","family":"Ma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Ning","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,30]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"J.A. Bondy and U. S. R. Murty,\n                      Graph Theory\n                      . Graduate Texts in Mathematics, Springer, New York, 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<11::AID-JGT3>3.0.CO;2-J"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.04.042"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.4064\/fm-40-1-42-55"},{"key":"atypb5","unstructured":"P. Erdo\u0308s,\n                      Some of My Favourite Unsolved Problems\n                      , Cambridge University Press, Cambridge, 1990."},{"key":"atypb6","first-page":"231","volume":"47","author":"Erdo\u0308s P.","year":"1992","journal-title":"Matematiche (Catania)"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90037-G"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/090761860"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-015-3262-0"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.08.002"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80025-1"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90004-1"},{"key":"atypb13","unstructured":"H.J. Voss,\n                      Cycles and Bridges in Graphs\n                      , Kluwer Academic Publishers, Dordrecht, VEB Deutscher Verlag der Wissenschaften, Berlin, 1991."},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197323883"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1053773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:52Z","timestamp":1787316832000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1053773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/15M1053773"],"URL":"https:\/\/doi.org\/10.1137\/15m1053773","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}