On powers of graphs of bounded NLC-width (clique-width)

Discrete Applied Mathematics

Volumn 155, Issue 14, 2007, Pages 1885-1893

  Suchan, Karol ^a,b   Todinca, Ioan ^b  

^a AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Clique width; Coloring; NLC width; Polynomial; Power graph

Indexed keywords

NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CLIQUE-WIDTH; NLC-WIDTH; POWER GRAPH; VERTEX SET;

GRAPH THEORY;

EID: 34547684278     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.03.014     Document Type: Article

References (12)

1. H. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen, λ-colorings of graphs, in: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 395-406.
2. H. Bodlaender, D. Kratsch, private communication, 2002.
3. Corneil D.G., and Rotics U. On the relationship between clique-width and treewidth. SIAM J. Comput. 34 4 (2005) 825-847
4. Courcelle B., and Olariu S. Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101 (2000) 77-114
5. W. Espelage, F. Gurski, E. Wanke, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, in: Workshop on Graph-theoretic Concepts in Computer Science (WG 2001), Lecture Notes in Computer Science, vol. 2204, Springer, Berlin, 2001, pp. 117-128.
6. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), Freeman, New York
7. Golumbic M., and Rotics U. On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci. 11 3 (2000) 423-443
8. Kobler D., and Rotics U. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126 2-3 (2003) 197-221
9. S. Oum, P. Seymour, Approximating clique-width and branch-width, see 〈http://www.princeton.edu/~sangil/〉.
10. I. Todinca, Coloring powers of graphs of bounded clique-width, in: Proceedings of the 29th Workshop on Graph-theoretic Concepts in Computer Science (WG 2003), Lecture Notes in Computer Science, vol. 2880, Springer, Berlin, 2003, pp. 370-382.
11. Wanke E. k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54 2-3 (1994) 251-266
12. Zhou X., Kanari Y., and Nishizeki T. Generalized vertex-colorings for partial k-trees. IEICE Trans. Fund. E83-A 4 (2000) 671-678