{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T06:34:08Z","timestamp":1774506848262,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0166-218x(95)00048-v","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"189-203","source":"Crossref","is-referenced-by-count":24,"title":["Algorithmic aspects of the generalized clique-transversal problem on chordal graphs"],"prefix":"10.1016","volume":"66","author":[{"given":"Chang","family":"Maw-Shang","sequence":"first","affiliation":[]},{"given":"Chen","family":"Yi-Hua","sequence":"additional","affiliation":[]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Jing-Ho","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00048-V_BIB1","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\/0166-218X(95)00048-V_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(95)00048-V_BIB3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","article-title":"Dominating sets for split and bipartite graphs","volume":"19","author":"Bertossi","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(95)00048-V_BIB4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00048-V_BIB5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/0406002","article-title":"Algorithmic aspects of neighborhood numbers","volume":"6","author":"Chang","year":"1993","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB6","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability problems on sun-free chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(95)00048-V_BIB7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(86)90156-1","article-title":"k, i-Covers I: complexity and polytopes","volume":"58","author":"Conforti","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","article-title":"The complexity of generalized clique covering","volume":"22","author":"Corneil","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB9","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/0608044","article-title":"A dynamic programming approach to the dominating set problem on k-trees","volume":"8","author":"Corneil","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(95)00048-V_BIB10","doi-asserted-by":"crossref","unstructured":"P. Erd\u00f6s, T. Gallai and Z. Tuza, Covering the cliques of a graph with vertices, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(92)90681-5"},{"key":"10.1016\/0166-218X(95)00048-V_BIB11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB12","series-title":"Proceedings 8th Southeastern Conference on Combinatorics","first-page":"311","article-title":"Split graphs","author":"F\u00f6ldes","year":"1977"},{"key":"10.1016\/0166-218X(95)00048-V_BIB13","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","article-title":"On chain and antichain families of a partially ordered set","volume":"29","author":"Frank","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(95)00048-V_BIB14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB15","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(95)00048-V_BIB16","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00048-V_BIB17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(95)00048-V_BIB18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB19","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(78)90003-1","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB20","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/net.3230170407","article-title":"Algorithms for maximum k-colorings and k-coverings of transitive graphs","volume":"17","author":"Gavril","year":"1987","journal-title":"Networks"},{"key":"10.1016\/0166-218X(95)00048-V_BIB21","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(95)00048-V_BIB22","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0097-3165(76)90078-9","article-title":"Some partitions associated with a partially ordered set","volume":"20","author":"Greene","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0166-218X(95)00048-V_BIB23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","article-title":"The structure of sperner k-families","volume":"20","author":"Greene","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0166-218X(95)00048-V_BIB24","first-page":"113","article-title":"\u00dcber die Auflos\u0308ung von Graphen in vollst\u00e4ndige Teilgraphen","volume":"1","author":"Hajnal","year":"1958","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","article-title":"Bibliography on domination in graphs and some definitions of domination parameters","volume":"86","author":"Hedetniemi","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB26","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(95)00048-V_BIB27","article-title":"k-Neighborhood covering and independence problems","author":"Hwang","year":"1993"},{"key":"10.1016\/0166-218X(95)00048-V_BIB28","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(95)00048-V_BIB29","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(86)90031-2","article-title":"Neighborhood perfect graphs","volume":"61","author":"Lehel","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB31","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90116-R","article-title":"Generalized vertex covering in interval graphs","volume":"39","author":"Marathe","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB32","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00048-V_BIB33","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0166-218X(95)00048-V_BIB34","first-page":"126","article-title":"The neighborhood number of a graph","volume":"16","author":"Sampathkumar","year":"1985","journal-title":"Indian J. Pure Appl. Math."},{"key":"10.1016\/0166-218X(95)00048-V_BIB35","unstructured":"J.P. Spinrad, Doubly lexical ordering of dense 0\u20131 matrices, preprint."},{"key":"10.1016\/0166-218X(95)00048-V_BIB36","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\/0166-218X(95)00048-V_BIB37","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge-deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00048-V_BIB38","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500048V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500048V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T04:56:26Z","timestamp":1556168186000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500048V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0166218X9500048V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00048-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}