Add to ORKGWe prove that every graph with circumference at most k is O(log k)- colourable such that every monochromatic component has size at most k. The O(log k) bound on the number of colours is best possible, even in the setting of colourings with bounded monochromatic degree.</p
Conference Proceeding of STOC 2001.We consider for graphs of maximum degree , the problem of determ...
For a fixed integer, the k-Colouring problem is to decide if the vertices of a graph can be coloured...
Author's own final version can be archived.Must link the journal to publisher's website.We prove tha...
AbstractThis paper concerns improper λ-colourings of graphs and focuses on the sizes of the monochro...
This paper concerns improper ?-colourings of graphs and focuses on the sizes of the monochromatic co...
This paper concerns improper ?-colourings of graphs and focuses on the sizes of the monochromatic co...
For every n∈N and k≥2, Gyárfás showed that every k-edge-colouring of the com...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
AbstractGiven a graph G and a positive integer p, χp(G) is the minimum number of colours needed to c...
Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of...
Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
AbstractThis paper concerns improper λ-colourings of graphs and focuses on the sizes of the monochro...
Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
Conference Proceeding of STOC 2001.We consider for graphs of maximum degree , the problem of determ...
For a fixed integer, the k-Colouring problem is to decide if the vertices of a graph can be coloured...
Author's own final version can be archived.Must link the journal to publisher's website.We prove tha...
AbstractThis paper concerns improper λ-colourings of graphs and focuses on the sizes of the monochro...
This paper concerns improper ?-colourings of graphs and focuses on the sizes of the monochromatic co...
This paper concerns improper ?-colourings of graphs and focuses on the sizes of the monochromatic co...
For every n∈N and k≥2, Gyárfás showed that every k-edge-colouring of the com...
The clique chromatic number of a graph is the minimum number of colours needed to colour its vertice...
AbstractGiven a graph G and a positive integer p, χp(G) is the minimum number of colours needed to c...
Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of...
Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
AbstractThis paper concerns improper λ-colourings of graphs and focuses on the sizes of the monochro...
Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
Conference Proceeding of STOC 2001.We consider for graphs of maximum degree , the problem of determ...
For a fixed integer, the k-Colouring problem is to decide if the vertices of a graph can be coloured...
Author's own final version can be archived.Must link the journal to publisher's website.We prove tha...