
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 083
- Pages: 213-219
- Published: 30/04/2007
Let
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 193-212
- Published: 30/04/2007
Let
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 179-191
- Published: 30/04/2007
By applying the method of generating function, the purpose of this paper is to give several summations of reciprocals related to
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 169-177
- Published: 30/04/2007
Bricks are polyominoes with labelled cells. The problem whether a given set of bricks is a code is undecidable in general. We consider sets consisting of square bricks only. We have shown that in this setting, the codicity of small sets (two bricks) is decidable, but
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 161-167
- Published: 30/04/2007
Let
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 145-160
- Published: 30/04/2007
Various authors have defined statistics on Dyck paths that lead to generalizations of the Catalan numbers. Three such statistics are area, maj, and bounce. Haglund, whe introduced the bounce statistic, gave an algebraic proof that
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 129-144
- Published: 30/04/2007
We develop a new type of a vertex labeling of graphs, namely
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 101-127
- Published: 30/04/2007
Let
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 93-99
- Published: 30/04/2007
In
- Research article
- Full Text
- Ars Combinatoria
- Volume 083
- Pages: 47-63
- Published: 30/04/2007
Let
with equality if and only if