COMBINATORICS
2006
13 years 11 months ago
2006
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 t 50 using computer programs, which are useful in recursive constructions for cyclic designs....
COMBINATORICS
2006
13 years 11 months ago
2006
COMBINATORICS
2006
13 years 11 months ago
2006
We prove the following extension of an old result of Andr
COMBINATORICS
2006
13 years 11 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
COMBINATORICS
2006
13 years 11 months ago
2006
COMBINATORICS
2006
13 years 11 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
COMBINATORICS
2006
13 years 11 months ago
2006
We determine the circular chromatic index of flower snarks, by showing that c(F3) = 7/2, c(F5) = 17/5 and c(Fk) = 10/3 for every odd integer k 7, where Fk denotes the flower snar...
COMBINATORICS
2006
13 years 11 months ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
COMBINATORICS
2006
13 years 11 months ago
2006
COMBINATORICS
2006
13 years 11 months ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...