![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ars Combinatoria, Volume 53
Volume 53, October 1999
- Deborah J. Street, Anne Penfold Street:
But where are designs used? Ars Comb. 53 (1999) - Jeh Gwon Lee:
The Edge Covering Number of Ordered Sets. Ars Comb. 53 (1999) - Michael Edwin Raines, Christopher A. Rodger:
Embedding Partial Extended Triple Systems when l >= 2. Ars Comb. 53 (1999) - John A. Bate, G. H. John van Rees:
The Size of the Smallest Strong Critical Set in a Latin Square. Ars Comb. 53 (1999) - Dawit Haile:
Bounds on the Size of Critical Edge-Chromatic Graphs. Ars Comb. 53 (1999) - Beiliang Du, W. D. Wallis:
The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares. Ars Comb. 53 (1999) - Arnold Knopfmacher, Michael E. Mays:
Compositions With m Distinct Parts. Ars Comb. 53 (1999) - Mats Näslund:
On Steiner Triple Systems and Perfect Codes. Ars Comb. 53 (1999) - Kevin T. Phelps, Carol Yin:
Generalized Steiner Systems With Block Size Three and Group Size Four. Ars Comb. 53 (1999) - Kong Gaohua, Zhang Xuebin:
On the existence of (v, n, 4, l)-IPMD for even l. Ars Comb. 53 (1999) - Eric Mendelsohn, Nabil Shalaby:
On Skolem Labelling of Windmills. Ars Comb. 53 (1999) - Chester J. Salwach:
Codes of C(n, n, 1) Designs. Ars Comb. 53 (1999) - Thomas Dale Porter:
Minimal Partitions of a Graph. Ars Comb. 53 (1999) - Brian Alspach, Joy Morris, V. Vilfred:
Self-complementary circulant graphs. Ars Comb. 53 (1999) - William L. Kocay, Ryan Szypowski:
The Application of Determining Sets to Projective Configurations. Ars Comb. 53 (1999) - Clark Kimberling, Harris S. Shultz:
Card Sorting by Dispersions and Fractal Sequences. Ars Comb. 53 (1999) - Michael S. Roddy:
A note on orders with level diagrams. Ars Comb. 53 (1999) - Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, G. H. John van Rees:
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb. 53 (1999) - David G. C. Horrocks:
On the Number of Dependent Sets in a Connected Graph. Ars Comb. 53 (1999) - Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Isomorphic Star Decompositions of Multicrowns and the Power of Cycles. Ars Comb. 53 (1999) - Jorge L. Ramírez Alfonsín:
Gracefulness of Replicated Paths and Cycles. Ars Comb. 53 (1999) - Toru Araki, Yukio Shibata:
Isomorphic factorization of complete bipartite graph into forest. Ars Comb. 53 (1999) - Dragan M. Acketa, Vojislav Mudrinski:
A family of 4-designs on 38 points. Ars Comb. 53 (1999) - Bridget S. Webb:
Infinite designs with more point orbits than block orbits. Ars Comb. 53 (1999) - Heping Zhang, Fuji Zhang:
Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs. Ars Comb. 53 (1999) - Hung-Lin Fu, Christopher A. Rodger:
Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53 (1999)
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.