
Ars Combinatoria
ISSN 0381-7032 (print), 2817-5204 (online)
Ars Combinatoria is the oldest Canadian Journal of Combinatorics, established in 1976. The journal is dedicated to advancing the field of combinatorial mathematics through the publication of high-quality research papers. From 2024 onward, it publishes four volumes per year in March, June, September and December. Ars Combinatoria has gained recognition and visibility in the academic community and is indexed in renowned databases such as MathSciNet, Zentralblatt, and Scopus. The Scope of the journal includes Graph theory, Design theory, Extremal combinatorics, Enumeration, Algebraic combinatorics, Combinatorial optimization, Ramsey theory, Automorphism groups, Coding theory, Finite geometries, Chemical graph theory but not limited.
Information Menu
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 89-94
- Published: 31/10/2008
The locally twisted cube
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 63-88
- Published: 31/10/2008
Necessary and sufficient conditions are given for the existence of a
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 41-62
- Published: 31/10/2008
A
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 31-40
- Published: 31/10/2008
In this paper, we consider the relationships between the sums of the Fibonacci and Lucas numbers and
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 21-30
- Published: 31/10/2008
We define extended orthogonal sets of
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 11-20
- Published: 31/10/2008
For two given graphs
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 3-9
- Published: 31/10/2008
A container
- Research article
- Full Text
- Ars Combinatoria
- Volume 089
- Pages: 205-222
- Published: 31/10/2008
Greedy defining sets have been studied for the first time by the author for graphs. In this paper, we consider greedy defining sets for Latin squares and study the structure of these sets in Latin squares. We give a general bound for greedy defining numbers and linear bounds for greedy defining numbers of some infinite families of Latin squares. Greedy defining sets of circulant Latin squares are also discussed in the paper.
- Research article
- Full Text
- Ars Combinatoria
- Volume 088
- Pages: 429-435
- Published: 31/07/2008
Let
- Research article
- Full Text
- Ars Combinatoria
- Volume 088
- Pages: 415-428
- Published: 31/07/2008
Let