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 show that a graph G has no houses and no holes if and only if for every connected induced subgraph H of G and every vertex in H, either the vertex is adjacent to all the other vertices in H, or it forms a 2-pair of H with some other vertex in H. As a consequence, there is a simple linear time algorithm to find a 2-pair in HH-free graphs. We also note that the class of Meyniel graphs admits an analogous...
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.