Write in a clean editor, then format for Journal of Combinatorial Designs in one click — DocuGuru applies the official Wiley template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Journal of Combinatorial Designs is a peer-reviewed journal published by Wiley, covering graph theory and CDMA systems, Coding theory and cryptography, Finite Group Theory Research.
| Publisher | Wiley |
|---|---|
| Reference style | Author–year (Chicago) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Journal of Combinatorial Designs 12 (3): 45–58.
Formats any DOI in Journal of Combinatorial Designs style. No sign-up. |
| Publishes research in | graph theory and CDMA systems Coding theory and cryptography Finite Group Theory Research Limits and Structures in Graph Theory Graph Labeling and Dimension Problems |
| ISSN | 1063-8539 |
| Citation impact (2-yr) | 0.45 |
| h-index | 44 |
| i10-index | 379 |
| Total citations | 12,503 |
| Article processing charge | $3,040 |
| Top institutions publishing here | Soochow University |
| Journal website | onlinelibrary.wiley.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Abstract We show that the necessary conditions for the decomposition of the complete graph of odd order into cycles of a fixed even length and for the decomposition of the complete graph of even order minus a 1‐factor into cycles of a fixed odd length are also sufficient. © 2002 John Wiley & Sons, Inc.…
A major contribution of [1] is a reduction of the problem of correcting errors in quantum computations to the construction of codes in binary symplectic spaces. This mechanism is known as the additive or stabilizer construction. We consider an obvious generalization of these quantum codes in the symplectic geometry setting and obtain general constructions using…
Abstract We present the numbers of isotopy classes and main classes of Latin squares, and the numbers of isomorphism classes of quasigroups and loops, up to order 10. The best previous results were for Latin squares of order 8 (Kolesova, Lam, and Thiel, 1990 ), quasigroups of order 6 (Bower, 2000 ), and loops of…
Abstract A t ‐covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2 t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t .…
By simulating an ergodic Markov chain whose stationary distribution is uniform over the space of n × n Latin squares, we can obtain squares that are (approximately) uniformly distributed; we offer two such chains. The central issue is the construction of “moves” that connect the squares. Our first approach uses the fact that an n…
