{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T09:48:09Z","timestamp":1698745689428},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T00:00:00Z","timestamp":1381190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9664-2","type":"journal-article","created":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T11:12:02Z","timestamp":1381144322000},"page":"729-746","source":"Crossref","is-referenced-by-count":1,"title":["Co-2-plex vertex partitions"],"prefix":"10.1007","volume":"30","author":[{"given":"Benjamin","family":"McClosky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Arellano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Illya V.","family":"Hicks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,8]]},"reference":[{"key":"9664_CR1","first-page":"33","volume":"47","author":"JA Andrews","year":"1985","unstructured":"Andrews JA, Jacobson MS (1985) On a generalization of chromatic number. Proceedings of the sixteenth Southeaster international conference on combinatorics, graph theory, and computing 47:33\u201348","journal-title":"Proceedings of the sixteenth Southeaster international conference on combinatorics, graph theory, and computing"},{"key":"9664_CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E Balas","year":"1996","unstructured":"Balas E, Xue J (1996) Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica 15:397\u2013412","journal-title":"Algorithmica"},{"key":"9664_CR3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s11590-009-0146-5","volume":"4\u20133","author":"B Balasundaram","year":"2010","unstructured":"Balasundaram B, Chandramouli SS, Trukhanov S (2010) Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. Optim Lett 4\u20133:311\u2013320","journal-title":"Optim Lett"},{"key":"9664_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22\u20134","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22\u20134:251\u2013256","journal-title":"Commun ACM"},{"key":"9664_CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/mnsc.19.4.456","volume":"19","author":"RJ Brown","year":"1972","unstructured":"Brown RJ (1972) Chromatic scheduling and the chromatic number problem. Manag Sci 19:451\u2013463","journal-title":"Manag Sci"},{"key":"9664_CR6","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","volume":"14","author":"N Christofides","year":"1971","unstructured":"Christofides N (1971) An algorithm for the chromatic number of a graph. Comput J 14:38\u201339","journal-title":"Comput J"},{"key":"9664_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","volume":"24\u20133","author":"LJ Cowen","year":"1997","unstructured":"Cowen LJ, Goddard W, Jesurum CE (1997) Defective coloring revisited. J Graph Theory 24\u20133:205\u2013219","journal-title":"J Graph Theory"},{"key":"9664_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10\u20132","author":"LJ Cowen","year":"1986","unstructured":"Cowen LJ, Cowen RH, Woodall DR (1986) Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J Graph Theory 10\u20132:187\u2013195","journal-title":"J Graph Theory"},{"key":"9664_CR9","volume-title":"Graph theory graduate texts in mathematics","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory graduate texts in mathematics, vol 173. Springer, Heidelberg"},{"key":"9664_CR10","unstructured":"Donnell AO, Sethu H (2004) On achieving software diversity for improved network security using distributed coloring algorithms. Proceedings of 11th ACM Conference on Computer and Communications Security, Washington, DC. ACM, New York, p 121\u2013131"},{"key":"9664_CR11","first-page":"69","volume-title":"Combinatorial structures and their applications","author":"J Edmonds","year":"1970","unstructured":"Edmonds J (1970) Matroids, submodular functions, and certain polyhedra. In: Guy RK, Hanani H, Sauer N, Sch\u00f6nheim J (eds) Combinatorial structures and their applications. Gordon and Breach, New York, pp 69\u201387"},{"key":"9664_CR12","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P (1959) Graph theory and probability. Can J Math 11:34\u201338","journal-title":"Can J Math"},{"key":"9664_CR13","doi-asserted-by":"crossref","unstructured":"Fountoulakis N, Kang RJ, McDiarmid CJH.(2010) The $$t$$ t -stability number of a random graph. Electron J Comb R(59)","DOI":"10.37236\/331"},{"key":"9664_CR14","unstructured":"Harary F (1985) Conditional colorability in graphs, Graphs and applications (Boulder, Colo. 1982), Wiley-Intersci. Publ., pp. 127\u2013136. Wiley, New York"},{"key":"9664_CR15","doi-asserted-by":"crossref","unstructured":"Kang RJ, McDiarmid CJH (2007) The $$t$$ t -improper chromatic number of random graphs. Proceedings of the Fourth European Conference on Combinatorics, Graph Theory and Applications, Seville, 2007, p 411\u2013417","DOI":"10.1016\/j.endm.2007.07.067"},{"key":"9664_CR16","first-page":"211","volume-title":"Combinatorial optimization","author":"SM Korman","year":"1979","unstructured":"Korman SM (1979) The graph colouring problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, New York, pp 211\u2013235"},{"key":"9664_CR17","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28\u20134","author":"M Kubale","year":"1985","unstructured":"Kubale M, Jackowski B (1985) A generalized implicit enumeration algorithm for graph coloring. Commun ACM 28\u20134:412\u2013418","journal-title":"Commun ACM"},{"key":"9664_CR18","first-page":"237","volume":"1","author":"L Lov\u00e1sz","year":"1966","unstructured":"Lov\u00e1sz L (1966) On decomposition of graphs. Studia Sci Math Hung 1:237\u2013238","journal-title":"Studia Sci Math Hung"},{"issue":"3","key":"9664_CR19","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/070687414","volume":"23","author":"B McClosky","year":"2009","unstructured":"McClosky B, Hicks IV (2009) The co-2-plex polytope and integral systems. SIAM J Discret Math 23(3):1135\u20131148","journal-title":"SIAM J Discret Math"},{"key":"9664_CR20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10878-010-9338-2","volume":"23\u20131","author":"B McClosky","year":"2012","unstructured":"McClosky B, Hicks IV (2012) Combinatorial algorithms for the maximum $$k$$ k -plex problem. J Comb Optim 23\u20131:29\u201349","journal-title":"J Comb Optim"},{"key":"9664_CR21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph theoretic generalization of the clique concept. J Math Sociol 6:139\u2013154","journal-title":"J Math Sociol"},{"key":"9664_CR22","first-page":"278","volume":"2731","author":"E Tomita","year":"2003","unstructured":"Tomita E, Seki T (2003) An efficient branch-and-bound algorithm for finding a maximum clique. LNCS Ser 2731:278\u2013289","journal-title":"LNCS Ser"},{"key":"9664_CR23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)00165-X","volume":"213","author":"DB West","year":"2000","unstructured":"West DB, Bollob\u00e1s B (2000) Generalized chromatic number and generalized girth. Discret Math 213:29\u201334","journal-title":"Discret Math"},{"key":"9664_CR24","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"DR Wood","year":"1997","unstructured":"Wood DR (1997) An algorithm for finding a maximum clique in a graph. Oper Res Lett 21:211\u2013217","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9664-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9664-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9664-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T11:51:56Z","timestamp":1596628316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9664-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,8]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9664"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9664-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,8]]}}}