An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of /nding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We /rst de/ne a wider class of graph...

The asteroidal main belt is crossed by a web of mean motion and secular resonances that occur when there commensurability between fundamental frequencies the asteroids planets. Traditionally, these objects were identified visual inspection time evolution their resonant argument, which combination orbital elements asteroid perturbing planet(s). Since population affected is, in some cases, order ...