Join Our Newsletter

17 search results - page 1 / 4» Perfect packings with complete graphs minus an edge |

EJC

2007

12 years 3 months ago
2007

Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...

ORL

2008

12 years 3 months ago
2008

Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...

JCO

2007

12 years 3 months ago
2007

A graph G is said to be m-sufﬁcient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...

DMTCS

2010

12 years 1 months ago
2010

A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...

RSA

2002

12 years 3 months ago
2002

: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...