Sciweavers

43 search results - page 3 / 9
» The game chromatic number of random graphs
Sort
View
COMBINATORICA
2011
13 years 9 months ago
On the chromatic number of random geometric graphs
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...
Colin McDiarmid, Tobias Müller
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
14 years 9 months ago
On the Quantum Chromatic Number of a Graph
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...
Peter J. Cameron, Ashley Montanaro, Michael W. New...
DAM
2008
134views more  DAM 2008»
14 years 9 months ago
Efficient algorithms for finding critical subgraphs
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...
Christian Desrosiers, Philippe Galinier, Alain Her...
60
Voted
CPC
2010
89views more  CPC 2010»
14 years 9 months ago
The t-Improper Chromatic Number of Random Graphs
Ross J. Kang, Colin McDiarmid
CPC
2008
67views more  CPC 2008»
14 years 9 months ago
On the Strong Chromatic Number of Random Graphs
Po-Shen Loh, Benny Sudakov