{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:25:01Z","timestamp":1767990301022,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3582,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0012-365x(03)00177-8","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"139-154","source":"Crossref","is-referenced-by-count":21,"title":["Subcolorings and the subchromatic number of a graph"],"prefix":"10.1016","volume":"272","author":[{"given":"John","family":"Gimbel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Hartman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00177-8_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","article-title":"The complexity of G-free colourability","volume":"165, 166","author":"Achlioptas","year":"1997","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"10.1016\/S0012-365X(03)00177-8_BIB2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","article-title":"The subchromatic number of a graph","volume":"74","author":"Albertson","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB3","unstructured":"L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Vol. 3, Academic Press, San Diego, CA, 1988."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB4","unstructured":"I. Broere, C.M. Mynhardt, Generalized colorings of outerplanar and planar graphs, in: Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, MI, 1984), Wiley, New York, 1985, pp. 151\u2013161."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(71)90065-7","article-title":"Graphs with forbidden subgraphs","volume":"10","author":"Chartrand","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB6","series-title":"Graphs & digraphs","author":"Chartrand","year":"1996"},{"issue":"2","key":"10.1016\/S0012-365X(03)00177-8_BIB7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","article-title":"Defective colorings of graphs in surfaces","volume":"10","author":"Cowen","year":"1986","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/S0012-365X(03)00177-8_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","article-title":"Defective coloring revisited","volume":"24","author":"Cowen","year":"1997","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB9","first-page":"95","article-title":"The edge subchromatic number of a graph","volume":"64","author":"Domke","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB10","unstructured":"G.S. Domke, R. Laskar, S.T. Hedetniemi, K. Peters, The partite-chromatic number of a graph, in: Proceedings of the 17th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1986, Vol. 53, 1986, pp. 235\u2013246."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB11","unstructured":"P. Erdo&#x030B;s, J. Gimbel, A note on the largest H-free subgraph in a random graph, in: Graph Theory, Combinatorics, and Applications, Vol. 1 (Kalamazoo, MI, 1988), Wiley, New York, 1991, pp. 435\u2013437."},{"issue":"6","key":"10.1016\/S0012-365X(03)00177-8_BIB12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/jgt.3190150604","article-title":"Some extremal results in cochromatic and dichromatic theory","volume":"15","author":"Erdo&#x030B;s","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB13","series-title":"Computers and intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB14","doi-asserted-by":"crossref","unstructured":"M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete problems, in: Sixth Annual ACM Symposium on Theory of Computing (Seattle, WA, 1974), Assoc. Comput. Mach., New York, 1974, pp. 47\u201363.","DOI":"10.1145\/800119.803884"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB15","unstructured":"J. Gimbel, J. Ne\u0161et\u0159il, Partitions of graphs into cographs, in: H. Nyklova (Ed.), Technical Report 493, DIMATIA Series in Applied Math, 2000."},{"issue":"11","key":"10.1016\/S0012-365X(03)00177-8_BIB16","doi-asserted-by":"crossref","first-page":"4555","DOI":"10.1090\/S0002-9947-97-01926-0","article-title":"Coloring graphs with fixed genus and girth","volume":"349","author":"Gimbel","year":"1997","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB17","first-page":"109","article-title":"Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz f\u00fcr dreikreisfreie Netze auf der Kugel","volume":"8","author":"Gr\u00f6tzsch","year":"1958","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB18","unstructured":"C. Hartman, Extremal problems in graph theory, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1997."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB19","unstructured":"M.S. Jacobson, The spot-chromatic number of K2t\u25a1 K2t, Presentation at Workshop in Discrete Mathematics, Louisville, KY, June 1997."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB20","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"issue":"1","key":"10.1016\/S0012-365X(03)00177-8_BIB21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2140\/pjm.1977.68.105","article-title":"On Ramsey theory and graphical parameters","volume":"68","author":"Lesniak-Foster","year":"1977","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB22","first-page":"39","article-title":"The cochromatic number of a graph","volume":"3","author":"Lesniak-Foster","year":"1977","journal-title":"Ars Combin."},{"issue":"1","key":"10.1016\/S0012-365X(03)00177-8_BIB23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01195327","article-title":"Gadget classification","volume":"9","author":"Loebl","year":"1993","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB24","first-page":"237","article-title":"On decomposition of graphs","volume":"1","author":"Lov\u00e1sz","year":"1966","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB25","unstructured":"C.M. Mynhardt, I. Broere, Generalized colorings of graphs, in: Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, MI, 1984), Wiley, New York, 1985, pp. 583\u2013594."},{"key":"10.1016\/S0012-365X(03)00177-8_BIB26","series-title":"An Atlas of Graphs","author":"Read","year":"1998"},{"key":"10.1016\/S0012-365X(03)00177-8_BIB27","unstructured":"P. Steinbach, Field Guide to Simple graphs, Design Lab, Albuquerque, 1990."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001778?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001778?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:26:16Z","timestamp":1551047176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0012365X03001778"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00177-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}