论文信息 - Independent sets in edge-clique graphs

Independent sets in edge-clique graphs

We first show that the independent set problem on edge-clique graphs of cographs can be solved in O(n2) time. We then show that the independent set problem on edge-clique graphs of graphs without odd wheels is NP-complete. We present a PTAS for planar graphs and show that the problem is polynomial for planar graphs without triangle separators. Lastly, we show that edge-clique graphs of cocktail party graphs have unbounded rankwidth.

[1] Van Bang Le. Gallai graphs and anti-Gallai graphs , 1996, Discret. Math..

[2] Norman J. Pullman. Clique Covering of Graphs IV. Algorithms , 1984, SIAM J. Comput..

[3] S. Aparna Lakshmanan,et al. Clique irreducibility of some iterative classes of graphs , 2008, Discuss. Math. Graph Theory.

[4] Boram Park,et al. The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares , 2009, Discret. Math..

[5] Paul Erdös,et al. On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order , 1960, Canadian Journal of Mathematics.

[6] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[7] E. Howorka. A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[8] J. Körner,et al. Intersection number and capacities of graphs , 1995, Discret. Math..

[9] Jian Zhang,et al. Finding orthogonal latin squares using finite model searching tools , 2011, Science China Information Sciences.

[10] Michal Pilipczuk,et al. Known Algorithms for Edge Clique Cover are Probably Optimal , 2012, SIAM J. Comput..