{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:50:04Z","timestamp":1773161404483,"version":"3.50.1"},"reference-count":12,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8890,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1982,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A lower bound is established on the number of edges in a maximum <jats:italic>k<\/jats:italic>\u2010colorable subgraph of a loopless graph <jats:italic>G<\/jats:italic>. For the special case of 3\u2010regular graphs, lower bounds are also determined on the maximum number of edges in a bipartite subgraph whose color classes are of equal size.<\/jats:p>","DOI":"10.1002\/jgt.3190060206","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:47:50Z","timestamp":1180421270000},"page":"123-132","source":"Crossref","is-referenced-by-count":30,"title":["Maximum <i>k<\/i>\u2010colorable subgraphs"],"prefix":"10.1002","volume":"6","author":[{"given":"S. C.","family":"Locke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"L. D.Andersen D. G.Grant andN.Linial Extremal k\u2010colourable subgraphs. To appear."},{"key":"e_1_2_1_3_2","unstructured":"J. A.Bondy private communication."},{"key":"e_1_2_1_4_2","unstructured":"J. A.BondyandS. C.Locke Largest bipartite subgraphs in triangle\u2010free graphs with maximum degree three. To appear."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1017\/S030500410002168X"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1973-048-x"},{"key":"e_1_2_1_7_2","unstructured":"R. C.EntringerandC.Sokel To appear."},{"key":"e_1_2_1_8_2","first-page":"283","article-title":"On even subgraphs of graphs","volume":"18","author":"Erd\u00f6s P.","year":"1964","journal-title":"Mat. Lapok."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760037"},{"key":"e_1_2_1_10_2","first-page":"153","volume-title":"Graph Theory and Related Topics (Proc. Waterloo Conf., Waterloo, 1977)","author":"Erd\u00f6s P.","year":"1979"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060205"},{"key":"e_1_2_1_12_2","first-page":"103","article-title":"Edge deletions and the chromatic number","volume":"10","author":"Staton W.","year":"1980","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804355"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190060206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190060206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:22:05Z","timestamp":1699766525000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190060206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["10.1002\/jgt.3190060206"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190060206","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}