50 search results - page 3 / 10 » On the Strong Chromatic Number of Random Graphs |
203
click to vote
COMBINATORICA
2011
13 years 11 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
98
Voted
COMBINATORICS
2007
14 years 11 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
100
click to vote
DAM
2008
14 years 11 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
66
Voted
CPC
2010
14 years 11 months ago
2010
CPC
2002
14 years 11 months ago
2002