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.
When the vertices and edges are coloured with k colours, an edge is called monochromatic if the edge and the two vertices incident with it all have the same colour. The chromatic capacity of a graph G, χCAP(G), is the largest integer k such that the edges of G can be coloured with k colours in such a way that when the vertices of G are coloured with the same set of colours, there is always a monochromatic...
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.