Sciweavers

DM
1998
66views more  DM 1998»
13 years 11 months ago
Steep polyominoes, q-Motzkin numbers and q-Bessel functions
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou...
DM
1998
40views more  DM 1998»
13 years 11 months ago
Strong orientations without even directed circuits
A. M. H. Gerards, F. Bruce Shepherd
DM
1998
68views more  DM 1998»
13 years 11 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
DM
1998
83views more  DM 1998»
13 years 11 months ago
The basis number of the powers of the complete graph
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
Salar Y. Alsardary, Jerzy Wojciechowski
DM
1998
195views more  DM 1998»
13 years 11 months ago
On basis-exchange properties for matroids
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
Joseph E. Bonin
DM
1998
95views more  DM 1998»
13 years 11 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...
DM
1998
48views more  DM 1998»
13 years 11 months ago
Lattices in graphs with polynomial growth
András Lukács, Norbert Seifter
DM
1998
94views more  DM 1998»
13 years 11 months ago
On embedding complete graphs into hypercubes
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
Michael Klugerman, Alexander Russell, Ravi Sundara...
DM
1998
60views more  DM 1998»
13 years 11 months ago
On numbers of Davenport-Schinzel sequences
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
Martin Klazar