A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...