50 search results - page 3 / 10 » On the Strong Chromatic Number of Random Graphs |
300
click to vote
COMBINATORICA
2011
14 years 5 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...
156
click to vote
COMBINATORICS
2007
15 years 5 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...
155
Voted
DAM
2008
15 years 5 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...
109
Voted
CPC
2010
15 years 5 months ago
2010
115
Voted
CPC
2002
15 years 5 months ago
2002