ENDM
2007
13 years 11 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
JGT
2006
13 years 11 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
JGT
2008
13 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...