617 search results - page 27 / 124 » On the Chromatic Number of Random Graphs |
CPC
2004
15 years 4 months ago
2004
145
click to vote
JGT
2008
15 years 4 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...
138
click to vote
COMBINATORICS
2000
15 years 4 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...