Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 261
Volume 261, Number 1-3, January 2003
- Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek
:
Preface. 1-2 - R. Julian R. Abel, Norman J. Finizio, Malcolm Greig:
(3, 6) GWhD(v)-existence results. 3-26 - Robert E. L. Aldred, Jozef Sirán, Martin Sirán:
A note on the number of graceful labellings of paths. 27-30 - Ian Anderson, Donald A. Preece:
Power-sequence terraces for where n is an odd prime power. 31-58 - Lynn Margaret Batten, Sharad S. Sane:
Permutations with a distinct difference property. 59-67 - Frank E. Bennett, Beiliang Du, Hantao Zhang:
Existence of self-orthogonal diagonal Latin squares with a missing subsquare. 69-86 - Elizabeth J. Billington, Dean G. Hoffman:
Decomposition of complete tripartite graphs into gregarious 4-cycles. 87-111 - Marco Buratti, Alberto Del Fra:
Existence of cyclic k-cycle systems of the complete graph. 113-125 - Yanxun Chang, Ying Miao:
Constructions for optimal optical orthogonal codes. 127-139 - Charles J. Colbourn, Alan C. H. Ling:
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. 141-156 - Peter Danziger, Eric Mendelsohn:
Bicolour graphs of Steiner triple systems. 157-176 - Italo J. Dejter:
Equitable factorizations of Hamming shells. 177-187 - Dameng Deng, Malcolm Greig, Patric R. J. Östergård:
More c-Bhaskar Rao designs with small block size. 189-208 - 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. 209-233 - Marialuisa J. de Resmini, Dieter Jungnickel:
Two infinite families of failed symmetric designs. 235-241 - Jeffrey H. Dinitz, Esther R. Lamken, Alan C. H. Ling:
Complementary partial resolution squares for Steiner triple systems. 243-254 - A. D. Forbes, Mike J. Grannell, Terry S. Griggs:
On colourings of Steiner triple systems. 255-276 - Brenton D. Gray, Rudolf Mathon, Tony Moran, Anne Penfold Street:
The spectrum of minimal defining sets of some Steiner systems. 277-284 - Ian D. Gray, Jim A. MacDougall, John P. McSorley, Walter D. Wallis:
Vertex-magic labeling of trees and forests. 285-298 - Malcolm Greig, David H. Rees:
Existence of balanced incomplete block designs for many sets of treatments. 299-324 - 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. 325-336 - Spencer P. Hurd, Dinesh G. Sarvate:
An application of partition of indices to enclosings of triple systems. 337-346 - Lijun Ji, Lie Zhu:
Constructions for Steiner quadruple systems with a spanning block design. 347-360 - Dieter Jungnickel, Leo Storme:
Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16. 361-371 - Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement W. H. Lam:
A note on {4}-GDDs of type 210. 373-376 - Alan C. H. Ling:
An application of splittable 4-frames to coloring of Kn, n. 377-382 - Zhiqiang Liu, Hao Shen:
Embeddings of almost resolvable triple systems. 383-398 - Lorenzo Milazzo, Zsolt Tuza, Vitaly I. Voloshin:
Strict colorings of Steiner triple and quadruple systems: a survey. 399-411 - Gaetano Quattrocchi:
Embedding handcuffed designs in D-designs, where D is the triangle with attached edge. 413-434 - Nabil Shalaby:
The existence of near-Rosa and hooked near-Rosa sequences. 435-450 - Jianxing Yin:
A new proof of a Colbourn-Rosa problem. 451-458
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
