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.Let G be a planar graph with maximum degree and girth g. The linear 2-arboricity la2(G) of G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2. We prove that (1) la2(G)(+1)/2+12; (2) la2(G)(+1)/2+6 if g4; (3) la2(G)(+1)/2+2 if g5; (4) la2(G)(+1)/2+1 if g7.
Abstract. For each vertex v in a graph G, the maximum length of a cycle which passes through v is called the cycle number of v, denoted by c(v). A sequence a1,a2,,an of nonnegative integers is called a cycle sequence of a graph G if the vertices of G can be labeled as v1,v2,,vn such that ai=c(vi) for 1in. We give some sufficient and necessary conditions for a sequence to be a cycle sequence. We can...
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.