GC
2007
Springer
13 years 8 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
GC
2007
Springer
13 years 8 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...
GC
2007
Springer
13 years 8 months ago
2007
Springer
GC
2007
Springer
13 years 8 months ago
2007
Springer
GC
2007
Springer
13 years 8 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
GC
2007
Springer
13 years 8 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
GC
2007
Springer
13 years 8 months ago
2007
Springer
GC
2007
Springer
13 years 8 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
GC
2007
Springer
13 years 8 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
GC
2007
Springer
13 years 8 months ago
2007
Springer
We determine lower and upper bounds for the size of a hyperplane of the dual polar space DW(5, q). In some cases, we also determine all hyperplanes attaining these bounds.