236 search results - page 3 / 48 » Graphs, partitions and Fibonacci numbers |
CPC
2004
13 years 7 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
ARSCOM
2007
13 years 8 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
EUROPAR
1999
Springer
14 years 5 days ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
DAM
2007
13 years 7 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...