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 a positive integer, and let G be a graph of order n ≥ 3 k and S be a set of k vertices of G . In this paper, we prove that if σ 2 ( G ) ≥ n + k − 1 + Δ ( G [ S ] ) , then G can be partitioned into k vertex-disjoint cycles C 1 , … , C k − 1 , C k such that | V ( C i ) ∩ S | = 1 for 1 ≤ i ≤ k , and | V ( C i ) | = 3 for 1...
Let G be a balanced bipartite graph of order 2 n ≥ 4 , and let σ 1 , 1 ( G ) be the minimum degree sum of two non-adjacent vertices in different partite sets of G . In 1963, Moon and Moser proved that if σ 1 , 1 ( G ) ≥ n + 1 , then G is hamiltonian. In this note, we show that if k is a positive integer, then the Moon–Moser condition also implies the existence of a 2-factor...
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.