Sciweavers

DM
2000
80views more  DM 2000»
13 years 11 months ago
An attempt to classify bipartite graphs by chromatic polynomials
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
DM
2000
99views more  DM 2000»
13 years 11 months ago
Chromatically unique bipartite graphs with low 3-independent partition numbers
For integers p; q; s with p
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
DM
2000
55views more  DM 2000»
13 years 11 months ago
The Extension Theorem
Nikolai P. Dolbilin
DM
2000
71views more  DM 2000»
13 years 11 months ago
Near-MDS codes over some small fields
Stefan M. Dodunekov, Ivan N. Landjev
DM
2000
108views more  DM 2000»
13 years 11 months ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy
DM
2000
115views more  DM 2000»
13 years 11 months ago
Dualizability and graph algebras
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
Brian A. Davey, Pawel M. Idziak, William A. Lampe,...
DM
2000
76views more  DM 2000»
13 years 11 months ago
On the number of ordered factorizations of natural numbers
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
Benny Chor, Paul Lemke, Ziv Mador
DM
2000
91views more  DM 2000»
13 years 11 months ago
Three distance theorem and grid graph
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
Nicolas Chevallier
DM
2000
89views more  DM 2000»
13 years 11 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
DM
2000
76views more  DM 2000»
13 years 11 months ago
Applications of integer relation algorithms
Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c such that caT = 0. We discuss the algorithms for nding such integer relations f...
Jonathan M. Borwein, Petr Lisonek