Results 1 to 10 of about 27 (21)

Hooked k-extended Skolem sequences

open access: closedDiscrete Mathematics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Václav Linek, Zhike Jiang
exaly   +5 more sources

The existence of near-Skolem and hooked near-Skolem sequences

open access: closedDiscrete Mathematics, 1994
The author has studied the near-Skolem and hooked near-Skolem sequences and it is proved that the arithmetic necessary conditions for the existence of near-Skolem and hooked near-Skolem sequences are also sufficient. These sequences are defined by the following: Let \(m\), \(n\) be integers, \(m\leq n\).
Nabil Shalaby
exaly   +4 more sources

The intersection spectrum of hooked Skolem sequences and applications

open access: closedDiscrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nabil Shalaby, Daniela Silvesan
exaly   +5 more sources

On the Beta-Number of Forests with Isomorphic Components

open access: yesDiscussiones Mathematicae Graph Theory, 2018
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio   +3 more
doaj   +1 more source
Some of the next articles are maybe not open access.

Extended near Skolem sequences Part II

Journal of Combinatorial Designs, 2021
Vaclav Linek, Nabil Shalaby
exaly  

Extended near Skolem sequences Part I

Journal of Combinatorial Designs, 2021
Vaclav Linek, Nabil Shalaby
exaly  

Extended near Skolem sequences, Part III

Journal of Combinatorial Designs, 2022
Vaclav Linek, Nabil Shalaby
exaly  

Skolem and Rosa rectangles and related designs

Discrete Mathematics, 2014
Vaclav Linek, Nabil Shalaby
exaly  

A survey of Skolem-type sequences and Rosa’s use of them

Mathematica Slovaca, 2009
Eric Mendelsohn
exaly  

Home - About - Disclaimer - Privacy