Search Results

There are 37581 results for: content related to: Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor

  1. Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd

    Journal of Combinatorial Designs

    Volume 18, Issue 6, November 2010, Pages: 401–414, Benjamin R. Smith

    Version of Record online : 20 SEP 2010, DOI: 10.1002/jcd.20268

  2. Cycle decompositions of complete multigraphs

    Journal of Combinatorial Designs

    Volume 19, Issue 1, January 2011, Pages: 42–69, Darryn Bryant, Daniel Horsley, Barbara Maenhaut and Benjamin R. Smith

    Version of Record online : 20 SEP 2010, DOI: 10.1002/jcd.20263

  3. Constructing regular self-complementary uniform hypergraphs

    Journal of Combinatorial Designs

    Volume 19, Issue 6, November 2011, Pages: 439–454, Shonda Gosselin

    Version of Record online : 16 JUN 2011, DOI: 10.1002/jcd.20286

  4. Decomposing complete equipartite graphs into short even cycles

    Journal of Combinatorial Designs

    Volume 19, Issue 2, March 2011, Pages: 131–143, Benjamin R. Smith and Nicholas J. Cavenagh

    Version of Record online : 20 SEP 2010, DOI: 10.1002/jcd.20265

  5. Reversible and DRAD difference sets in

    Journal of Combinatorial Designs

    Volume 20, Issue 1, January 2012, Pages: 58–67, Jordan D. Webster

    Version of Record online : 22 NOV 2011, DOI: 10.1002/jcd.20305

  6. Constructions for cyclic 3-designs and improved results on cyclic Steiner quadruple systems

    Journal of Combinatorial Designs

    Volume 19, Issue 3, May 2011, Pages: 178–201, Tao Feng and Yanxun Chang

    Version of Record online : 20 SEP 2010, DOI: 10.1002/jcd.20264

  7. Constructions of nets via OAs of strength 3 with a prescribed property

    Journal of Combinatorial Designs

    Volume 19, Issue 2, March 2011, Pages: 144–155, Yang Li and Jianxing Yin

    Version of Record online : 20 SEP 2010, DOI: 10.1002/jcd.20267

  8. On spherical designs obtained from Q-polynomial association schemes

    Journal of Combinatorial Designs

    Volume 19, Issue 3, May 2011, Pages: 167–177, Sho Suda

    Version of Record online : 1 FEB 2011, DOI: 10.1002/jcd.20278

  9. Geometrical constructions of class-uniformly resolvable structure

    Journal of Combinatorial Designs

    Volume 19, Issue 5, September 2011, Pages: 329–344, Peter Danziger, Malcolm Greig and Brett Stevens

    Version of Record online : 16 JUN 2011, DOI: 10.1002/jcd.20284

  10. Generalized covering designs and clique coverings

    Journal of Combinatorial Designs

    Volume 19, Issue 5, September 2011, Pages: 378–406, Robert F. Bailey, Andrea C. Burgess, Michael S. Cavers and Karen Meagher

    Version of Record online : 31 MAY 2011, DOI: 10.1002/jcd.20288

  11. Perfect difference families, perfect difference matrices, and related combinatorial structures

    Journal of Combinatorial Designs

    Volume 18, Issue 6, November 2010, Pages: 415–449, Gennian Ge, Ying Miao and Xianwei Sun

    Version of Record online : 28 OCT 2010, DOI: 10.1002/jcd.20259

  12. A combinatorial approach to transitive extensions of generously unitransitive permutation groups

    Journal of Combinatorial Designs

    Volume 18, Issue 5, September 2010, Pages: 369–391, M. H. Klin, D. M. Mesner and A. J. Woldar

    Version of Record online : 19 FEB 2010, DOI: 10.1002/jcd.20250

  13. A family of pandiagonal bimagic squares based on orthogonal arrays

    Journal of Combinatorial Designs

    Volume 19, Issue 6, November 2011, Pages: 427–438, Kejun Chen, Wen Li and Fengchu Pan

    Version of Record online : 26 APR 2011, DOI: 10.1002/jcd.20287

  14. Intriguing sets in partial quadrangles

    Journal of Combinatorial Designs

    Volume 19, Issue 3, May 2011, Pages: 217–245, John Bamberg, Frank De Clerck and Nicola Durante

    Version of Record online : 20 SEP 2010, DOI: 10.1002/jcd.20269

  15. Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph

    Journal of Combinatorial Designs

    Volume 21, Issue 1, January 2013, Pages: 1–23, Marco Buratti and Francesca Merola

    Version of Record online : 24 MAY 2012, DOI: 10.1002/jcd.21311

  16. New results on GDDs, covering, packing and directable designs with block size 5

    Journal of Combinatorial Designs

    Volume 18, Issue 5, September 2010, Pages: 337–368, R. Julian R. Abel, Ahmed M. Assaf, Iliya Bluskov, Malcolm Greig and Nabil Shalaby

    Version of Record online : 29 JUL 2010, DOI: 10.1002/jcd.20253

  17. The complete (k, 3)-arcs of PG(2,q), q≤13

    Journal of Combinatorial Designs

    Volume 20, Issue 2, February 2012, Pages: 89–111, K. Coolsaet and H. Sticker

    Version of Record online : 25 AUG 2011, DOI: 10.1002/jcd.20293

  18. Decomposing complete multipartite graphs into closed trails of arbitrary even lengths

    Journal of Combinatorial Designs

    Volume 19, Issue 6, November 2011, Pages: 455–462, Benjamin R. Smith, Selda Küçükçifçi and Emineşule Yazıcı

    Version of Record online : 15 SEP 2011, DOI: 10.1002/jcd.20304

  19. P3BD-closed sets

    Journal of Combinatorial Designs

    Volume 19, Issue 6, November 2011, Pages: 407–421, Junling Zhou and Yanxun Chang

    Version of Record online : 26 JUL 2011, DOI: 10.1002/jcd.20292

  20. Exponential bounds on the number of designs with affine parameters

    Journal of Combinatorial Designs

    Volume 18, Issue 6, November 2010, Pages: 475–487, David Clark, Dieter Jungnickel and Vladimir D. Tonchev

    Version of Record online : 29 SEP 2010, DOI: 10.1002/jcd.20256

    Corrected by:

    Correction to: “Exponential bounds on the number of designs with affine parameters”

    Vol. 19, Issue 2, 156–166, Version of Record online: 18 FEB 2011