26 research outputs found
Langford sequences and a product of digraphs
Skolem and Langford sequences and their many generalizations have
applications in numerous areas. The -product is a generalization of
the direct product of digraphs. In this paper we use the -product
and super edge-magic digraphs to construct an exponential number of Langford
sequences with certain order and defect. We also apply this procedure to
extended Skolem sequences.Comment: 10 pages, 6 figures, to appear in European Journal of Combinatoric
Some Topics of Special Interest in Graph Theory
Not availabl
Some Investigations in the Theory of Graphs
Not availabl
Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
It is conjectured that for every pair of odd integers greater than
2 with , there exists a cyclic two-factorization of
having exactly factors of type and all the
others of type . The authors prove the conjecture in the affirmative
when and .Comment: 31 page