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.
For a given graph H and a positive n, the rainbow number of H, denoted by rb(n,H), is the minimum integer k so that in any edge-coloring of Kn with k colors there is a copy of H whose edges have distinct colors. In 2004, Schiermeyer determined rb(n,kK2) for all n≥3k+3. The case for smaller values of n (namely, n∈[2k,3k+2]) remained generally open. In this paper we extend Schiermeyer’s result to all...
An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum positive integer p such that whenever the edges of the graph G are colored with r colors, the vertices of G 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.