{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T01:43:53Z","timestamp":1775958233296,"version":"3.50.1"},"reference-count":12,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider a graph G and a positive integer <jats:italic>k<\/jats:italic>. The <jats:italic>maximum k\u2010coloring<\/jats:italic> problem is to color a maximum number of vertices using k colors, such that no two adjacent vertices have the same color. The <jats:italic>maximum k\u2010covering<\/jats:italic> problem is to find <jats:italic>k<\/jats:italic> disjoint cliques covering a maximum number of vertices. The present paper contains polynomial time algorithms for finding maximum <jats:italic>k<\/jats:italic>\u2010colorings and maximum <jats:italic>k<\/jats:italic>\u2010coverings of transitive graphs.<\/jats:p>","DOI":"10.1002\/net.3230170407","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:50:16Z","timestamp":1178923816000},"page":"465-470","source":"Crossref","is-referenced-by-count":29,"title":["Algorithms for maximum <i>k<\/i>\u2010colorings and <i>k<\/i>\u2010coverings of transitive graphs"],"prefix":"10.1002","volume":"17","author":[{"given":"F\u01cenic\u01ce","family":"Gavril","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1985.118.249"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321707.321710"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90079-9"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_6_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010completeness","author":"Garey M. R.","year":"1978"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90078-9"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90077-7"},{"key":"e_1_2_1_9_2","first-page":"619","volume-title":"Proc. of the NATO Advanced Study Institute held at Banff Canada, 1981","author":"Hoffman A. J.","year":"1982"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90046-8"},{"key":"e_1_2_1_11_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(81)90029-7"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1971-016-5"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T03:54:02Z","timestamp":1697860442000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170407"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170407","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}