![](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 52
Volume 52, June 1999
- Margit Voigt:
Colouring of distance graphs. Ars Comb. 52 (1999) - Yoshimi Egawa, Masahiko Miyamoto:
Graph Labelings in Boolean Lattices. Ars Comb. 52 (1999) - Mark Ramras:
Regular Subgraphs of Hypercubes. Ars Comb. 52 (1999) - Mary M. Miller, Robert C. Brigham, Ronald D. Dutton:
An Equation Involving the Neighborhood (Two-Step) and Line Graphs. Ars Comb. 52 (1999) - Patric R. J. Östergård:
New Constructions for q-ary Covering Codes. Ars Comb. 52 (1999) - Elizabeth J. Billington, Darryn E. Bryant:
The possible number of cycles in cycle systems. Ars Comb. 52 (1999) - Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Ralph Gordon Stanton:
A census of minimum pair-coverings with restricted largest block length. Ars Comb. 52 (1999) - Mariagrazia Bianchi, Anna Gillio, Libero Verardi:
Counting Squares of n-Subsets in Finite Groups. Ars Comb. 52 (1999) - Yair Caro, Raphael Yuster:
Graphs Having the Local Decomposition Property. Ars Comb. 52 (1999) - Klaus Dohmen:
On Partial Sums of Chromatic Polynomials. Ars Comb. 52 (1999) - Jean E. Dunbar, Johannes H. Hattingh, Renu C. Laskar, Lisa R. Markus:
Domination Using Induced Cliques in Graphs. Ars Comb. 52 (1999) - Yunsun Nam:
Integral Matrices with Given Row and Column Sums. Ars Comb. 52 (1999) - Jennifer D. Key, F. E. Sullivan:
Steiner Systems From Binary Codes. Ars Comb. 52 (1999) - Anthony J. Macula:
An Analysis of the Lines in the Three Dimensional Affine Space Over F3. Ars Comb. 52 (1999) - Marty J. Wolf, David J. Haglin:
An Optimal Algorithm for Finding All Convex Subsets in Tournaments. Ars Comb. 52 (1999) - J. Ghoshal, Renu C. Laskar, Dan Pillone:
Further Results on Minimal Rankings. Ars Comb. 52 (1999) - Gholamreza B. Khosrovshahi, Hamid Reza Maimani:
On 2-(v, 3) Steiner Trades of Small Volumes. Ars Comb. 52 (1999) - S. Arumugam, S. Velammal:
Maximum Size of a Connected Graph with Given Domination Parameters. Ars Comb. 52 (1999) - Y. S. Liaw:
More Z-Cyclic Room Squares. Ars Comb. 52 (1999) - Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai:
Connectivity of cycle matroids and bicircular matroids. Ars Comb. 52 (1999) - Marina Martinova:
An Isomorphic Decomposition of K24. Ars Comb. 52 (1999) - S. Mishra:
Some New Characterizations of Matroids. Ars Comb. 52 (1999) - Joël Puech:
Stability, domination, and irredundance in WAR graphs. Ars Comb. 52 (1999) - Katja Valentin:
Polychrome labelings of trees and cycle. Ars Comb. 52 (1999) - Bolian Liu, Bo Zhou:
A Generalization of Maximal k-Multiple-Free Sets of Integers. Ars Comb. 52 (1999) - Kathleen A. S. Quinn:
Difference Matrices and Orthomorphisms over Non-Abelian Groups. Ars Comb. 52 (1999) - Noga Alon, Eldar Fischer:
Refining the Graph Density Condition for the Existence of Almost K-factors. Ars Comb. 52 (1999) - Uri Blass, Simon Litsyn:
The smallest covering code of length 8 and radius 2 has 12 words. Ars Comb. 52 (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.