Sciweavers

ARSCOM
2005
67views more  ARSCOM 2005»
13 years 11 months ago
Avoidable Sets in The Bicyclic Inverse Semigroup
A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two dis...
Nándor Sieben
ARSCOM
2005
64views more  ARSCOM 2005»
13 years 11 months ago
Hamilton Paths in Certain Arithmetic Graphs
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
Paul A. Russell
ARSCOM
2005
61views more  ARSCOM 2005»
13 years 11 months ago
On multi-avoidance of generalized patterns
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In thre...
Sergey Kitaev, Toufik Mansour
ARSCOM
2005
59views more  ARSCOM 2005»
13 years 11 months ago
Simultaneous Avoidance Of Generalized Patterns
In [BabStein] Babson and Steingr
Sergey Kitaev, Toufik Mansour
ARSCOM
2005
98views more  ARSCOM 2005»
13 years 11 months ago
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan ...
ARSCOM
2005
64views more  ARSCOM 2005»
13 years 11 months ago
Further results for partitions into four squares of equal parity
We prove several results dealing with various counting functions for partitions of an integer into four squares of equal parity. Some are easy consequences of earlier work, but tw...
Michael D. Hirschhorn, James A. Sellers
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 11 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read
ARSCOM
2005
92views more  ARSCOM 2005»
13 years 11 months ago
Binary Strings Without Odd Runs of Zeros
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
Ralph Grimaldi, Silvia Heubach
ARSCOM
2005
48views more  ARSCOM 2005»
13 years 11 months ago
Properties for a Certain Family of Knot Diagrams
Darrin D. Frey, James A. Sellers