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 give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipancyclic. The first one concerns graphs that satisfy a “bipartite Ore's condition”, that is graphs such that any two nonadjacent vertices in both parts of the bipartition have degree sum at least n, and the second one is for bipartite balanced traceable graphs containing an hamiltonian path whose extremities...
Let G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for every integer l,3⩽l⩽|S|, there exists a cycle in G that contains exactly l vertices of S. We prove that if the degree sum in G of every pair of nonadjacent vertices of S is at least n, then G is either S-pancyclable or else n is even, S=V(G) and G=K n/2,n/2 , or |S|=4, G[S]=K 2,2 and the structure...
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.