617 search results - page 27 / 124 » On the Chromatic Number of Random Graphs |
CPC
2006
14 years 11 months ago
2006
CPC
2004
14 years 11 months ago
2004
RSA
2002
14 years 11 months ago
2002
103
click to vote
JGT
2008
14 years 11 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
COMBINATORICS
2000
14 years 11 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...