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.
Abstract.A. Saito conjectured that every finite 3-connected line graph of diameter at most 3 is hamiltonian unless it is the line graph of a graph obtained from the Petersen graph by adding at least one pendant edge to each of its vertices. Here we shall see that a line graph of connectivity 3 and diameter at most 3 has a hamiltonian path.
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.