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.
Let k be an integer greater than one, and let G be a simple graph with at least 4k+1 vertices. In this article, we prove that if σ 2 (G)⩾|V(G)|, then for an edge e of G, there exists a 2-factor with k cycles that contains e, or |V(G)| is even and G has a vertex cover of size |V(G)|/2 containing the endpoints of e. Here σ 2 (G) is the minimum degree sum for a pair of non-adjacent vertices.
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.