{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T21:14:31Z","timestamp":1722114871747},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1016\/j.amc.2006.12.027","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T15:12:11Z","timestamp":1166627531000},"page":"1410-1418","source":"Crossref","is-referenced-by-count":8,"title":["The algorithmic complexity of the minus clique-transversal problem"],"prefix":"10.1016","volume":"189","author":[{"given":"Guangjun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erfang","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2006.12.027_bib1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/j.amc.2006.12.027_bib2","unstructured":"M. Aigner, T. Andreae, Vertex-sets that meet all maximal cliques of a graph, 1986."},{"key":"10.1016\/j.amc.2006.12.027_bib3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(98)00087-9","article-title":"On the clique-transversal number of chordal graphs","volume":"191","author":"Andreae","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2006.12.027_bib4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(91)90055-7","article-title":"Clique-transversal sets of line graphs and complements of line graphs","volume":"88","author":"Andreae","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2006.12.027_bib5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(96)00054-3","article-title":"Clique transversal and clique independence on comparability graphs","volume":"58","author":"Balachandhran","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.amc.2006.12.027_bib6","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/j.amc.2006.12.027_bib7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(95)00048-V","article-title":"Algorithmic aspects of the generalized clique-transversal problem on chordal graphs","volume":"66","author":"Chang","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2006.12.027_bib8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(98)00019-2","article-title":"Maximum h-colourable subgraph problem in balanced graphs","volume":"65","author":"Dahlhaus","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.amc.2006.12.027_bib9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0166-218X(95)00056-W","article-title":"The algorithmic complexity of minus domination in graphs","volume":"68","author":"Dunbar","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2006.12.027_bib10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1021363810398","article-title":"On clique-transversals and clique-independent sets","volume":"116","author":"Dur\u00e1n","year":"2002","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.amc.2006.12.027_bib11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0012-365X(92)90681-5","article-title":"Covering the cliques of a graph with vertices","volume":"108","author":"Erd\u0151s","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2006.12.027_bib12","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.amc.2006.12.027_bib13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0166-218X(99)00159-6","article-title":"Algorithmic aspects of clique-transversal and clique-independent sets","volume":"100","author":"Guruswami","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2006.12.027_bib14","article-title":"Dominating function in graphs","volume":"vol. II","author":"Henning","year":"1998"},{"key":"10.1016\/j.amc.2006.12.027_bib15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0304-3975(02)00434-6","article-title":"Lower bounds on the minus domination and k-subdomination numbers","volume":"296","author":"Kang","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.amc.2006.12.027_bib16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0095-8956(90)90101-5","article-title":"An upper bound for the transversal numbers of 4-uniform hypergraphs","volume":"50","author":"Lai","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.amc.2006.12.027_bib17","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.dam.2005.07.011","article-title":"Distance-hereditary graphs are clique-perfect","volume":"154","author":"Lee","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2006.12.027_bib18","first-page":"307","article-title":"A note on stable sets and colourings of graphs","volume":"15","author":"Poljak","year":"1974","journal-title":"Comment. Math. Univ. Carolin"},{"key":"10.1016\/j.amc.2006.12.027_bib19","series-title":"Graph Theory, Combinatorics and Applications: Proceedings of the 7th Quadrennial International Conference on the Theory and Applications","first-page":"945","article-title":"Graphs with few cliques","author":"Prisner","year":"1995"},{"key":"10.1016\/j.amc.2006.12.027_bib20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","article-title":"Covering all cliques of a graph","volume":"86","author":"Tuza","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2006.12.027_bib21","unstructured":"G. Xu, E. Shan, M. Zhao, Clique domination in graphs, ARS Combin, in press."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0096300306017279?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0096300306017279?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T18:27:59Z","timestamp":1547144879000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300306017279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["S0096300306017279"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.amc.2006.12.027","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}