We study problems related to the chromatic number of a random intersection graph G (n,m, p). We introduce two new algorithms which colour G (n,m, p) with almost optimum number of colours with probability tending to 1 as n → ∞. Moreover we find a range of parameters for which the chromatic number of G (n,m, p) asymptotically equals its clique number
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
<p>Given a graph G and an integer k, two players take turns coloring the vertices of G one by one us...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
Abstract. The injective chromatic number of a graph G is the minimum number of colours needed to col...
We consider random graphs G,,., , with f ixed edge-probabil i ty p. We ref ine an argument of Bol l...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
<p>Given a graph G and an integer k, two players take turns coloring the vertices of G one by one us...
We study graph parameters arising from different types of colourings of random graphs, defined broad...
The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a ve...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
We consider the problem of k-colouring a random r-uniform hypergraph with n vertices and cn edges, w...
some probability distribution ν on R d). For i � = j we join Xi and Xj by an edge if �Xi − Xj �< ...
AbstractIn this work we show that, for any fixed d, random d-regular graphs asymptotically almost su...
Abstract. The injective chromatic number of a graph G is the minimum number of colours needed to col...
We consider random graphs G,,., , with f ixed edge-probabil i ty p. We ref ine an argument of Bol l...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$...
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using...
<p>We consider the problem of <em>k</em>-colouring a random <em>r</em>-uniform hypergraph with <em>n...
<p>Given a graph G and an integer k, two players take turns coloring the vertices of G one by one us...
DOI
Add to ORKG