{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T22:34:24Z","timestamp":1769121264244,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s00493-007-2169-9","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T05:20:29Z","timestamp":1211952029000},"page":"519-550","source":"Crossref","is-referenced-by-count":3,"title":["Complete partitions of graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[]},{"given":"Sivaramakrishnan","family":"Sivasubramanian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"key":"2169_CR1","unstructured":"S. Arora and C. Lund: Hardness of approximations, in: D. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996."},{"issue":"3","key":"2169_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof verification and hardness of approximation problems, J. ACM 45(3) (1998), 501\u2013555.","journal-title":"J. ACM"},{"key":"2169_CR3","first-page":"1131","volume":"80","author":"R. Balasubramanian","year":"2003","unstructured":"R. Balasubramanian, V. Raman and V. Yegnanarayanan: On the pseudoachromatic number of join of graphs, J. Computer Math. 80 (2003), 1131\u20131137.","journal-title":"J. Computer Math."},{"issue":"3","key":"2169_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","volume":"31","author":"H. L. Bodlaender","year":"1989","unstructured":"H. L. Bodlaender: Achromatic number is NP-complete for cographs and interval graphs, Inform. Process. Lett. 31(3) (1989), 135\u2013138.","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"2169_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.4064\/fm-102-3-159-164","volume":"102","author":"V. N. Bhave","year":"1979","unstructured":"V. N. Bhave: On the pseudoachromatic number of a graph, Fund. Math. 102(3) (1979), 159\u2013164.","journal-title":"Fund. Math."},{"key":"2169_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0195-6698(80)80001-1","volume":"1","author":"B. Bollob\u00e1s","year":"1980","unstructured":"B. Bollob\u00e1s, P. A. Catlin and P. Erd\u0151s: Hadwiger\u2019s conjecture is true for almost all graphs, Europ. J. Combin. 1 (1980), 195\u2013199.","journal-title":"Europ. J. Combin."},{"key":"2169_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1090\/conm\/147\/01171","volume":"147","author":"B. Bollob\u00e1s","year":"1993","unstructured":"B. Bollob\u00e1s, B. Reed and A. Thomason: An extremal function for the achromatic number, Graph structure theory, 161\u2013165, Contemp. Math. 147, AMS 1993.","journal-title":"Graph structure theory"},{"issue":"3","key":"2169_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/(SICI)1097-0118(199711)26:3<129::AID-JGT3>3.0.CO;2-T","volume":"26","author":"N. Cairnie","year":"1997","unstructured":"N. Cairnie and K. J. Edwards: Some results on the achromatic number, J. Graph Theory 26(3) (1997), 129\u2013136.","journal-title":"J. Graph Theory"},{"key":"2169_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0012-365X(97)00278-1","volume":"188","author":"N. Cairnie","year":"1998","unstructured":"N. Cairnie and K. J. Edwards: The achromatic number of bounded degree trees, Discrete Math. 188 (1998), 87\u201397.","journal-title":"Discrete Math."},{"key":"2169_CR10","doi-asserted-by":"crossref","unstructured":"J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz and J. Naor: Tight lower bounds for the asymmetric k-center problem, in Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), 21\u201327, 2004.","DOI":"10.1145\/1007352.1007363"},{"issue":"2","key":"2169_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D. Dubhashi","year":"1998","unstructured":"D. Dubhashi and D. Ranjan: Balls and bins: A study in negative dependence, Random Structures and Algorithms 13(2) (1998), 99\u2013124.","journal-title":"Random Structures and Algorithms"},{"key":"2169_CR12","doi-asserted-by":"crossref","unstructured":"K. J. Edwards: The harmonious chromatic number and the achromatic number, in Surveys in Combinatorics 1997, Cambridge University Press, pages 13\u201347, 1997.","DOI":"10.1017\/CBO9780511662119.003"},{"key":"2169_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0012-365X(00)00025-X","volume":"219","author":"K. J. Edwards","year":"2000","unstructured":"K. J. Edwards: Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi, Discrete Math. 219 (2000), 271\u2013274.","journal-title":"Discrete Math."},{"key":"2169_CR14","unstructured":"J. Edmonds and E. L. Johnson: Matching: A well solved class of integer linear programs, in Combinatorial Structures and Their Appl. (Proc. Calgary Internat. Conf.), pages 89\u201392, 1970."},{"key":"2169_CR15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","volume":"57","author":"K. J. Edwards","year":"1995","unstructured":"K. J. Edwards and C. J. H. McDiarmid: The complexity of harmonious coloring for trees, Disc. Appl. Math. 57 (1995), 133\u2013144.","journal-title":"Disc. Appl. Math."},{"issue":"2","key":"2169_CR16","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"U. Feige: A threshold of ln n for approximating set cover, J. ACM 45(2) (1998), 634\u2013652.","journal-title":"J. ACM"},{"issue":"1","key":"2169_CR17","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2002","unstructured":"U. Feige, M. M. Halld\u00f3rsson, G. Kortsarz and A. Srinivasan: Approximating the domatic number, SIAM J. Computing 32(1) (2002), 172\u2013195.","journal-title":"SIAM J. Computing"},{"key":"2169_CR18","doi-asserted-by":"crossref","unstructured":"H. N. Gabow: An efficient reduction technique for degree constrained subgraph and bidirected network flow problems, in Proc. 15th Annual ACM Symposium on Theory of Computing (STOC), pages 448\u2013456, 1983.","DOI":"10.1145\/800061.808776"},{"key":"2169_CR19","first-page":"229","volume-title":"Recent Progress in Combinatorics","author":"R. P. Gupta","year":"1969","unstructured":"R. P. Gupta: Bounds on the chromatic and achromatic numbers of complementary graphs, in Recent Progress in Combinatorics Academic Press, New York (1969), pp. 229\u2013235."},{"issue":"4","key":"2169_CR20","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"M. M. Halld\u00f3rsson","year":"1993","unstructured":"M. M. Halld\u00f3rsson: Approximating the minimum maximal independence number, Inform. Process. Lett. 46(4) (1993), 169\u2013172.","journal-title":"Inform. Process. Lett."},{"key":"2169_CR21","unstructured":"M. M. Halld\u00f3rsson: An approximation algorithm for complete partitions of regular graphs, Unpublished manuscript, http:\/\/www.hi.is\/:_mmh\/publications.html , February 2004."},{"key":"2169_CR22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad: Clique is hard to approximate within n 1\u2212\u03b5 , Acta Mathematica 182 (1999), 105\u2013142.","journal-title":"Acta Mathematica"},{"key":"2169_CR23","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"J. H\u00e5stad: Some optimal inapproximability results, J. ACM 48 (2001), 798\u2013859.","journal-title":"J. ACM"},{"key":"2169_CR24","doi-asserted-by":"crossref","unstructured":"E. Halperin and R. Krauthgamer: Polylogarithmic inapproximability, in Proc. 35th Annual ACM Symposium on Theory of Computing (STOC), 585\u2013594, 2003.","DOI":"10.1145\/780542.780628"},{"key":"2169_CR25","unstructured":"S. Hedetniemi: Open problems in combinatorial optimization, Webpage at www.cs.clemson.edu\/:_hedet\/coloring.html , September 1998."},{"issue":"5","key":"2169_CR26","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"C. Lund and M. Yannakakis: On the hardness of approximating minimization problems, J. ACM 41(5) (1994), 960\u2013981.","journal-title":"J. ACM"},{"key":"2169_CR27","first-page":"37","volume":"38","author":"A. V. Kostochka","year":"1982","unstructured":"A. V. Kostochka: The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37\u201358 (in Russian).","journal-title":"Metody Diskret. Analiz."},{"issue":"3","key":"2169_CR28","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/s00453-001-0021-y","volume":"30","author":"G. Kortsarz","year":"2001","unstructured":"G. Kortsarz: On the hardness of approximating spanners, Algorithmica 30(3) (2001), 432\u2013450.","journal-title":"Algorithmica"},{"issue":"3","key":"2169_CR29","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/S0895480100379579","volume":"14","author":"G. Kortsarz","year":"2000","unstructured":"G. Kortsarz and R. Krauthgamer: On the approximation of the achromatic number, SIAM Journal of Discrete Math. 14(3) (2000), 408\u2013422.","journal-title":"SIAM Journal of Discrete Math."},{"key":"2169_CR30","unstructured":"G. Kortsarz, J. Radhakrishnan and S. Sivasubramanian: Complete partitions of graphs, in Proc. 16th Annual SIAM-ACM Symp. Discrete Algorithms (SODA), pages 860\u2013869, 2005."},{"key":"2169_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/978-3-540-39658-1_36","volume-title":"Proceedings of 11th European Symposium on Algorithms","author":"G. Kortsarz","year":"2003","unstructured":"G. Kortsarz and S. Shende: Approximating the achromatic number problem on bipartite graphs, in Proceedings of 11th European Symposium on Algorithms (Budapest, 2003), Lecture Notes in Computer Science 2832, Springer, Berlin (2003), pp. 385\u2013396."},{"key":"2169_CR32","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0305004100059648","volume":"92","author":"C. J. H. McDiarmid","year":"1982","unstructured":"C. J. H. McDiarmid: Achromatic numbers of random graphs, Mathematical Proceedings of Cambridge Philosophical Society 92 (1982), 21\u201328.","journal-title":"Mathematical Proceedings of Cambridge Philosophical Society"},{"key":"2169_CR33","first-page":"148","volume":"141","author":"C. McDiarmid","year":"1989","unstructured":"C. McDiarmid: On the method of bounded differences, London Mathematical Society Lecture Notes Series 141 (1989), 148\u2013188.","journal-title":"London Mathematical Society Lecture Notes Series"},{"issue":"3","key":"2169_CR34","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"R. Raz: A parallel repetition theorem, SIAM J. Comput. 27(3) (1998), 763\u2013803.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2169_CR35","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N. Robertson","year":"1993","unstructured":"N. Robertson, P. D. Seymour and R. Thomas: Hadwiger\u2019s conjecture for K 6-free graphs, Combinatorica 13(3) (1993), 279\u2013361.","journal-title":"Combinatorica"},{"issue":"1","key":"2169_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0012-365X(76)90093-5","volume":"16","author":"E. Sampathkumar","year":"1976","unstructured":"E. Sampathkumar and V. N. Bhave: Partition graphs and coloring numbers of a graph, Discorete Math. 16(1) (1976), 57\u201360.","journal-title":"Discorete Math."},{"key":"2169_CR37","first-page":"25","volume":"3","author":"V. G. Vizing","year":"1964","unstructured":"V. G. Vizing: On an estimate of the chromatic class of a p-graph, Diskret. Anal. 3 (1964), 25\u201330 (in Russian).","journal-title":"Diskret. Anal."},{"key":"2169_CR38","first-page":"199","volume":"62","author":"V. Yegnanarayanan","year":"2002","unstructured":"V. Yegnanarayanan: On pseudocoloring of graphs, Util. Math. 62 (2002), 199\u2013216.","journal-title":"Util. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2169-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2169-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2169-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:48:03Z","timestamp":1738241283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2169-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["2169"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2169-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}