Independent sets of maximum weight in (p,q)-colorable graphs

Discrete Mathematics

Volumn 265, Issue 1-3, 2003, Pages 351-356

  Alekseev, Vladimir E ^a   Lozin, Vadim V ^b  

^a LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Independent set; Polynomial algorithm; Weighted graph

Indexed keywords

EID: 84867964747     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00877-4     Document Type: Article

References (16)

1. V.E. Alekseev, On the local restrictions eLect on the complexity of2nding the graph independence number, Combinatorial-algebraic methods in applied mathematics, Gorkiy Univ. Press, Gorkiy, 1983, pp. 3-13 (in Russian).
2. V.E. Alekseev, On the number ofmaximal independent sets in graphs from hereditary classes, Combinatorial-algebraic methods in discrete optimization, University ofNizhny Novgorod, 1991, pp. 5-8 (in Russian).
3. E. Balas, Ch.S. Yu, On graphs with polynomially solvable maximum-weight clique problem, Networks 19 (1989) 247-253.
4. P. Bertolazzi, C. De Simone, A. Galuccio, A nice class for the vertex packing problem, Discrete Appl. Math. 76 (1997) 3-19.
5. R.L. Brooks, On coloring the nodes ofa network, Proc. Cambridge Phil. Soc. 37 (1941) 194-197.
6. D.G. Corneil, The complexity ofgeneralized clique packing, Discrete Appl. Math. 12 (1985) 233-239.
7. S. Foldes, P.L. Hammer, Split graphs, Congres. Numer. 19 (1977) 311-315.
8. R.L. Graham, B.L. Rothschild, J.H. Spencer, Ramsey Theory, Wiley, New York, 1980.
9. M. GrPotschel, L. LovQasz, A. Schrijver, Polynomial algorithms for perfect graphs, Ann. Discrete Math. 21 (1984) 325-356.
10. L. LovQasz, M.D. Plummer, Matching theory, Ann. Discrete Math. 29 (1986) 471-480.
11. G.J. Minty, On maximal independent sets ofvertices in claw-free graphs, J. Combin. Theory Ser. B 28 (1980) 284-304.
12. D. Nakamura, A. Tamura, A revision ofMinty's algorithm for 2nding a maximum weight stable set of a claw-free graph, J. Oper. Res. Soc. Japan 44 (2) (2001) 194-204.
13. S. Poljak, A note on stable sets and coloring ofgraphs, Comment. Math. Univ. Carolinae 15 (1974) 307-309.
14. E. Prisner, Graphs with few cliques, Graph Theory, Combinatorics, and Algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 945-956, Wiley-Interscience Publ., Wiley, New York, 1995.
15. N. Sbihi, Algorithme de recherche d'un stable de cardinalitQe maximum dans un graphe sans Qetoile, Discrete Math. 29 (1980) 53-76.
16. S. Tsukiyama, M. Ide, H. Ariyoshi, I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6 (1977) 505-517.