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.
A non-increasing sequence π=(d1,d2,…,dn) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. We say that G is a realization of π (or π is realizable by G). Let Z3 be a cyclic group of order three. If π has a realization G which is Z3-connected, then π has a Z3-connected realization G. Yang et al. (2014) proposed the following problem: Characterize...
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.