Some new partially symmetric designs and their resolution
Some New Tilings of the Sphere with Congruent Triangles
Some observations on the constructions of chemical balance weighing designs
The construction of some optimum chemical balance weighing designs from affine μ-resolvable balanced incomplete block (BIB) designs are discussed in the light of a characterization theorem on the parameters of affine μ-resolvable BIB designs as given by Mohan and Kageyama (1982), for the sake of practical use of researchers who need some selective designs for the construction of chemical balance weighing designs.
Some pairwise balanced designs.
Some problems of classification of points in the Desarguesian Hjelmslev plane
Some properties of automorphism groups of paving matroids.
Some recent results on duality and planarity
Some remarks on Ramsey matroids
Some remarks on the number of different triple systems of Steiner
Some remarks on the Steiner triple systems associated with Steiner quadruple systems
Some results in discrete mathematics and digital geometry by Professor Dragan Acketa.
Some results on odd astral configurations.
Some results on the problem of Erdös and Hajnal.
Spaces of Domino Tilings.
Spanning trees with many or few colors in edge-colored graphs
Given a graph G = (V,E) and a (not necessarily proper) edge-coloring of G, we consider the complexity of finding a spanning tree of G with as many different colors as possible, and of finding one with as few different colors as possible. We show that the first problem is equivalent to finding a common independent set of maximum cardinality in two matroids, implying that there is a polynomial algorithm. We use the minimum dominating set problem to show that the second problem is NP-hard.
Spectra Of Graphs Formed By Some Unary Operations
Spectra of graphs formed by some unary operations.
Spectrum Of The Total Graph Of A Graph
Spherical F-tilings by triangles and -sided regular polygons, .
Squares in difference sets