Squares of Intersection Graphs and Induced Matchings

Alekseev, 2004, Polynomial algorithm for finding the largest independent sets in graphs without forks, Discrete Appl. Math., 135, 3, 10.1016/S0166-218X(02)00290-1 Balas, 1989, On graphs with polynomially solvable maximal-weight clique problem, Networks, 19, 247, 10.1002/net.3230190206 Berge, 1989 Beineke, 1968, 17 Cameron, 1989, Induced matchings, Discrete Appl. Math., 24, 97, 10.1016/0166-218X(92)90275-F Fricke, 1992, Strong matchings in trees, Congr. Numer., 89, 239 Golumbic, 1993, Irredundancy in circular arc graphs, Discrete Appl. Math., 44, 79, 10.1016/0166-218X(93)90223-B Golumbic, 2000, New results on induced matchings, Discrete Appl. Math., 101, 157, 10.1016/S0166-218X(99)00194-8 Kobler, 2003, Finding maximum induced matchings in subclasses of claw-free and P5-free graphs, and in graphs with matching and induced matching of equal maximum size, Algorithmica, 37, 327, 10.1007/s00453-003-1035-4 Lozin, 2002, On maximum induced matchings in bipartite graphs, Inform. Process. Lett., 81, 7, 10.1016/S0020-0190(01)00185-5 Lozin, 2002, Bipartite graphs without a skew star, Discrete Math., 257, 83, 10.1016/S0012-365X(01)00471-X Lozin, V., and M. Milanic, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, DIMACS technical report 2005-38 Lozin, 2003, Some results on graphs without long induced paths, Inform. Process. Letters, 88, 167, 10.1016/j.ipl.2003.07.004 Minty, 1980, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory Ser. B, 28, 284, 10.1016/0095-8956(80)90074-X Nakamura, 2001, A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph, J. Oper. Res. Soc. Japan, 44, 194 Stockmeyer, 1982, NP-completeness of some generalizations of the maximum matching problem, Inform. Process. Lett., 15, 14, 10.1016/0020-0190(82)90077-1 Tsukiyama, 1977, A new algorithm for generating all the maximal independent sets, SIAM J. Comput., 6, 505, 10.1137/0206036 Whitney, 1932, Congruent graphs and the connectivity of graphs, Am. J. Math., 54, 150, 10.2307/2371086