
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN: 0835-3026 (print) 2817-576X (online)
The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) embarked on its publishing journey in April 1987. From 2024 onward, it publishes four volumes per year in March, June, September and December. JCMCC has gained recognition and visibility in the academic community and is indexed in renowned databases such as MathSciNet, Zentralblatt, Engineering Village and Scopus. The scope of the journal includes; Combinatorial Mathematics, Combinatorial Computing, Artificial Intelligence and applications of Artificial Intelligence in various files.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 225-229
- Published: 31/10/1995
A simple new proof of an existence condition for periodic complementary binary sequences is given. In addition, this result is extended to the general case, which was previously unsolved.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 209-224
- Published: 31/10/1995
Token-passing algorithms are a well-known way of solving distributed mutual exclusion problems in computer networks. A simple abstraction of the concept of tokens allows the use of elementary constructions in general hypergraphs to show that certain sets of tokens are minimal. This suggests other problems about hypergraphs worthy of exploration. As an application, we introduce a new mutual exclusion problem, the
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 207-208
- Published: 31/10/1995
A PBD construction for six MOLS of order
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 193-206
- Published: 31/10/1995
Two algorithms to compute monotone stabbers for convex polygons are presented. More precisely, given a set of
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 171-191
- Published: 31/10/1995
Several algorithms for geometric constructions on the real projective plane are described. These methods also apply to Euclidean plane geometry. The concept of an augmented determining set is fundamental to the algorithms. A backtracking algorithm to find augmented determining sets is described. Algorithms for animating constructions, and an incidence-forcing algorithm are also presented. These algorithms have been implemented on an
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 161-170
- Published: 31/10/1995
A tournament design,
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 151-160
- Published: 31/10/1995
We provide two new upper bounds on the total chromatic number of all hypergraphs and give two conjectures related to both the Total Colouring Conjecture for graphs and the Erdős-Faber-Lovász Conjecture.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 129-150
- Published: 31/10/1995
The first serious mathematical study of whist tournament designs was carried out in the 1890s by E.H. Moore. In this survey, I shall outline briefly the subsequent work which culminated in the proof of the existence of whist tournaments of all possible orders by Baker, Wilson, and Hanani in the 1970s, and then describe some more recent work, mainly by N.J. Finizio, Y.S. Liaw, and the author, on the construction of cyclic whist tournaments. In particular, triple whist tournaments will be discussed.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 109-128
- Published: 31/10/1995
A graph
- every
-connected -free graph is pancyclic, if is -free and , if is -free and , or if is -free, deer-free and , and - every
-connected -free and -free graph on vertices is cycle extendible using at most two chords of the cycle.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 019
- Pages: 97-107
- Published: 31/10/1995
The problem of finding the distance between two graphs is known to be NP-complete. In this paper, we describe a heuristic algorithm that uses simulated annealing to find an upper bound for the distance between two graphs. One of the motivations for developing such an algorithm comes from our interest in finding the diameter of families of non-isomorphic extremal graphs. We tested our algorithm on each family of extremal graphs with up to