The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2003, volume: 261, number: 1-3

  1. Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:1-2 [Journal]
  2. R. Julian R. Abel, Norman J. Finizio, Malcolm Greig
    (3, 6) GWhD(v)-existence results. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:3-26 [Journal]
  3. Robert E. L. Aldred, Jozef Sirán, Martin Sirán
    A note on the number of graceful labellings of paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:27-30 [Journal]
  4. Ian Anderson, Donald A. Preece
    Power-sequence terraces for where n is an odd prime power. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:31-58 [Journal]
  5. Lynn Margaret Batten, Sharad S. Sane
    Permutations with a distinct difference property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:59-67 [Journal]
  6. Frank E. Bennett, Beiliang Du, Hantao Zhang
    Existence of self-orthogonal diagonal Latin squares with a missing subsquare. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:69-86 [Journal]
  7. Elizabeth J. Billington, Dean G. Hoffman
    Decomposition of complete tripartite graphs into gregarious 4-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:87-111 [Journal]
  8. Marco Buratti, Alberto Del Fra
    Existence of cyclic k-cycle systems of the complete graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:113-125 [Journal]
  9. Yanxun Chang, Ying Miao
    Constructions for optimal optical orthogonal codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:127-139 [Journal]
  10. Charles J. Colbourn, Alan C. H. Ling
    Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:141-156 [Journal]
  11. Peter Danziger, Eric Mendelsohn
    Bicolour graphs of Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:157-176 [Journal]
  12. Italo J. Dejter
    Equitable factorizations of Hamming shells. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:177-187 [Journal]
  13. Dameng Deng, Malcolm Greig, Patric R. J. Östergård
    More c-Bhaskar Rao designs with small block size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:189-208 [Journal]
  14. Dameng Deng, Rolf S. Rees, Hao Shen
    On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:209-233 [Journal]
  15. Marialuisa J. de Resmini, Dieter Jungnickel
    Two infinite families of failed symmetric designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:235-241 [Journal]
  16. Jeffrey H. Dinitz, Esther R. Lamken, Alan C. H. Ling
    Complementary partial resolution squares for Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:243-254 [Journal]
  17. A. D. Forbes, Mike J. Grannell, Terry S. Griggs
    On colourings of Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:255-276 [Journal]
  18. Brenton D. Gray, Rudolf Mathon, Tony Moran, Anne Penfold Street
    The spectrum of minimal defining sets of some Steiner systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:277-284 [Journal]
  19. I. D. Gray, Jim A. MacDougall, John P. McSorley, Walter D. Wallis
    Vertex-magic labeling of trees and forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:285-298 [Journal]
  20. Malcolm Greig, David H. Rees
    Existence of balanced incomplete block designs for many sets of treatments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:299-324 [Journal]
  21. Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger
    A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k), kgeq3, where c(k) is a quadratic function of k. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:325-336 [Journal]
  22. Spencer P. Hurd, Dinesh G. Sarvate
    An application of partition of indices to enclosings of triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:337-346 [Journal]
  23. Lijun Ji, Lie Zhu
    Constructions for Steiner quadruple systems with a spanning block design. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:347-360 [Journal]
  24. Dieter Jungnickel, Leo Storme
    Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:361-371 [Journal]
  25. Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement W. H. Lam
    A note on {4}-GDDs of type 210. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:373-376 [Journal]
  26. Alan C. H. Ling
    An application of splittable 4-frames to coloring of Kn, n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:377-382 [Journal]
  27. Zhiqiang Liu, Hao Shen
    Embeddings of almost resolvable triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:383-398 [Journal]
  28. Lorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin
    Strict colorings of Steiner triple and quadruple systems: a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:399-411 [Journal]
  29. Gaetano Quattrocchi
    Embedding handcuffed designs in D-designs, where D is the triangle with attached edge. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:413-434 [Journal]
  30. Nabil Shalaby
    The existence of near-Rosa and hooked near-Rosa sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:435-450 [Journal]
  31. Jianxing Yin
    A new proof of a Colbourn-Rosa problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:451-458 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002