The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We define a new form of graph decomposition, based on forbidding a fixed bipartite graph from occurring as an induced subgraph of edges which cross a partition of the vertices. We show that the generalized join decomposition proposed by Hsu (J. Combin. Theory Ser. B 43 (1987) 70) is NP-complete, while some other decompositions which can be described in this way can be found in polynomial time.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.