{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T03:28:08Z","timestamp":1784086088608,"version":"3.55.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"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":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00198-1","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T16:05:14Z","timestamp":1035821114000},"page":"197-221","source":"Crossref","is-referenced-by-count":122,"title":["Edge dominating set and colorings on graphs with fixed clique-width"],"prefix":"10.1016","volume":"126","author":[{"given":"Daniel","family":"Kobler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Udi","family":"Rotics","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00198-1_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0166-218X(91)90010-T","article-title":"NP-completeness of edge colouring some restricted graphs","volume":"30","author":"Cai","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB2","unstructured":"D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width \u2a7d 3 graphs (Extended Abstract), in: Proceedings of the Latin American Theoretical INformatic, LATIN\u20192000, Lecture Notes in Computer Science, Vol. 1776, Springer, New York, 2000, pp. 126\u2013134."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB3","unstructured":"B. Courcelle, private communication."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraphs grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique-width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","article-title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic","volume":"108","author":"Courcelle","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","article-title":"Upper bounds to the clique-width of graphs","volume":"101","author":"Courcelle","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(00)00006-6","article-title":"Feasible edge colorings of trees with cardinality constraints","volume":"222","author":"de Werra","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(95)00055-V","article-title":"Restrictions and preassignments in preemptive open shop scheduling","volume":"68","author":"de Werra","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB10","unstructured":"P. Erd\u0151s, A.L. Rubin, H. Taylor, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, CA, Congressus Numerentium XXVI 1979, pp. 125\u2013157."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB11","unstructured":"J.F. Fink, M.S. Jacobson, n-domination in graphs, in: Y. Alavi, G. Chartrand, L. Lesniak, D.R. Lick, C.E. Wall (Eds.), Graph Theory with Applications to Algorithms and Computer Science, Wiley, New York, 1985, pp. 283\u2013300."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB12","unstructured":"J.F. Fink, M.S. Jacobson, On n-domination, n dependence and forbidden subgraphs, in: Y. Alavi, G. Chartrand, L. Lesniak, D.R. Lick, C.E. Wall (Eds.), Graph Theory with Applications to Algorithms and Computer Science, Wiley, New York, 1985, pp. 301\u2013311."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB13","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB14","unstructured":"M.U. Gerber, D. Kobler, Algorithms for vertex partitioning problems on graphs with fixed clique-width, 2000, Theor. Comput. Sci., to appear."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1142\/S0129054100000260","article-title":"On the clique-width of some perfect graph classes","volume":"11","author":"Golumbic","year":"2000","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB16","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB17","doi-asserted-by":"crossref","unstructured":"K. Jansen, Complexity results for the optimum cost chromatic partition problem, Technical Report, 1996.","DOI":"10.1007\/3-540-62592-5_58"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB18","doi-asserted-by":"crossref","unstructured":"K. Jansen, P. Scheffler, Some coloring results for tree like graphs, in: Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science Vol. 657, Springer, New York, 1992, pp. 50\u201359.","DOI":"10.1007\/3-540-56402-0_35"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB19","first-page":"39","article-title":"Clique-decomposition, NLC-decomposition, and modular decomposition-relationships and results for random graphs","volume":"132","author":"Johansson","year":"1998","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB20","unstructured":"D. Kobler, U. Rotics, Polynomial algorithms for partitioning problems on graphs with fixed clique-width (Extended Abstract), in: Proceedings of the 12th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, SODA\u201901, 2001, pp. 468\u2013476."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(92)90202-L","article-title":"Some results concerning the complexity of restricted colorings of graphs","volume":"36","author":"Kubale","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB22","doi-asserted-by":"crossref","unstructured":"C. Lautemann, Logical definability of NP-optimization problems with monadic auxiliary predicates, Lecture Notes in Computer Science, Vol. 702, Springer, New York, 1993, pp. 327\u2013339.","DOI":"10.1007\/3-540-56992-8_19"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1142\/S0129054199000241","article-title":"On the clique-width of graphs with few P4's","volume":"10","author":"Makowsky","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","article-title":"Finding a maximum planar subset of a set of nets in a channel","volume":"1","author":"Supowit","year":"1987","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB25","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","article-title":"Algorithms for vertex partitioning problems on partial k-trees","volume":"10","author":"Telle","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00198-1_BIB26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.7151\/dmgt.1049","article-title":"Graph colorings with local constraints\u2014A survey","volume":"17","author":"Tuza","year":"1997","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00198-1_BIB27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","article-title":"k-NLC graphs and polynomial algorithms","volume":"54","author":"Wanke","year":"1994","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T14:17:12Z","timestamp":1583590632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02001981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02001981"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00198-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}