Edge dominating set and colorings on graphs with fixed clique-width

Discrete Applied Mathematics

Volumn 126, Issue 2-3, 2003, Pages 197-221

  Kobler, Daniel ^a   Rotics, Udi ^b  

^a FIELDS INSTITUTE   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Clique width; Coloring; Dominating set; Edge coloring; Edge dominating set; Polynomial algorithms

Indexed keywords

COLORING; COSTS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

CLIQUE-WIDTH; DOMINATING SETS; EDGE COLORING; EDGE DOMINATING SET; POLYNOMIAL ALGORITHM;

GRAPH THEORY;

EID: 84867942957     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00198-1     Document Type: Article

References (27)

1. L. Cai, and J.A. Ellis NP-completeness of edge colouring some restricted graphs Discrete Appl. Math. 30 1991 15 27
2. D.G. Corneil, M. Habib, J.M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width 3 graphs (Extended Abstract), in: Proceedings of the Latin American Theoretical INformatic, LATIN'2000, Lecture Notes in Computer Science, Vol. 1776, Springer, New York, 2000, pp. 126-134.
3. B. Courcelle, private communication.
4. B. Courcelle, J. Engelfriet, and G. Rozenberg Handle-rewriting hypergraphs grammars J. Comput. System Sci. 46 1993 218 270
5. B. Courcelle, J.A. Makowsky, and U. Rotics Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Systems 33 2000 125 150
6. B. Courcelle, J.A. Makowsky, and U. Rotics On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic Discrete Appl. Math. 108 2001 23 52
7. B. Courcelle, and S. Olariu Upper bounds to the clique-width of graphs Discrete Appl. Math. 101 2000 77 114
8. D. de Werra, A. Hertz, D. Kobler, and N.V.R. Mahadev Feasible edge colorings of trees with cardinality constraints Discrete Math. 222 2000 61 72
9. D. de Werra, A. Hoffman, N.V.R. Mahadev, and U. Peled Restrictions and preassignments in preemptive open shop scheduling Discrete Appl. Math. 68 1996 169 188
10. P. Erdos, 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-157.
11. 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-300.
12. 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-311.
13. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman New York
14. M.U. Gerber, D. Kobler, Algorithms for vertex partitioning problems on graphs with fixed clique-width, 2000, Theor. Comput. Sci., to appear.
15. M.C. Golumbic, and U. Rotics On the clique-width of some perfect graph classes Internat. J. Found. Comput. Sci. 11 2000 423 443
16. I. Holyer The NP-completeness of edge-coloring SIAM J. Comput. 10 1981 718 720
17. K. Jansen, Complexity results for the optimum cost chromatic partition problem, Technical Report, 1996.
18. 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-59.
19. O. Johansson Clique-decomposition, NLC-decomposition, and modular decomposition-relationships and results for random graphs Congr. Numer. 132 1998 39 60
20. D. Kobler, U. Rotics, Polynomial algorithms for partitioning problems on graphs with fixed clique-width (Extended Abstract), in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'01, 2001, pp. 468-476.
21. M. Kubale Some results concerning the complexity of restricted colorings of graphs Discrete Appl. Math. 36 1992 35 46
22. 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-339.
23. 4's Internat. J. Found. Comput. Sci. 10 1999 329 348
24. K.J. Supowit Finding a maximum planar subset of a set of nets in a channel IEEE Trans. Comput. Aided Design 1 1987 93 94
25. J.A. Telle, and A. Proskurowski Algorithms for vertex partitioning problems on partial k-trees SIAM J. Discrete Math. 10 1997 529 550
26. Zs. Tuza Graph colorings with local constraints - A survey Discuss. Math. Graph Theory 17 1997 161 228
27. E. Wanke k-NLC graphs and polynomial algorithms Discrete Appl. Math. 54 1994 251 266