Sciweavers

692 search results - page 9 / 139
» Combinatorics of Partial Derivatives
Sort
View
COMBINATORICS
2006
96views more  COMBINATORICS 2006»
13 years 10 months ago
A New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Mark A. Shattuck, Carl G. Wagner
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 10 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
COMBINATORICS
2004
121views more  COMBINATORICS 2004»
13 years 10 months ago
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...
Peter Danziger, Brett Stevens
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
13 years 10 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
13 years 10 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler