Volume LXXVII, October, 2005

Research Article

Closest approximations to real numbers

Tripathi, Amitabha; Vijay, Sujith

Ars Comb. 77, 3-8 (2005).

Research Article

A note on graphs with largest total \(k\)-domination number

Chen, Xuegang; Ma, Dexiang; Sun, Liang

Ars Comb. 77, 9-16 (2005).

Research Article

Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns

Claesson, Anders; Mansour, Toufik

Ars Comb. 77, 17-31 (2005).

Research Article

Several definitions of matroids

Blasiak, J.; Rowe, J.; Traldi, L.; Yacobi, O.

Ars Comb. 77, 33-44 (2005).

Research Article

List coloring Halin graphs

Wang, Wei-Fan; Lih, Ko-Wei

Ars Comb. 77, 53-63 (2005).

Research Article

Arithmetic properties for a certain family of knot diagrams

Frey, Darrin D.; Sellers, James A.

Ars Comb. 77, 65-73 (2005).

Research Article

Magic squares, finite planes and simple quasilattices

Leech, Jonathan

Ars Comb. 77, 75-96 (2005).

Research Article

Isometrically embedded graphs

Boutin, Debra L.

Ars Comb. 77, 97-108 (2005).

Research Article

Maximal-clique partitions of different sizes

Uiyyasathian, Chariya; Fraughnaugh, Kathryn

Ars Comb. 77, 109-114 (2005).

Research Article

A decoding scheme for the 4-ary lexicodes with dm=4

Kim, D. G.

Ars Comb. 77, 115-127 (2005).

Research Article

On the trees whose 2-step competition numbers are two

Cho, Han Hyuk; Kim, Suh-Ryung; Nam, Yunsun

Ars Comb. 77, 129-142 (2005).

Research Article

Associated graphs of \(p\)-dimensional \((0,1)\)-matrices

Peterson, Dale

Ars Comb. 77, 143-160 (2005).

Research Article

Degree sequences of optimally edge-connected multigraphs

Dankelmann, Peter; Oellermann, Ortrud

Ars Comb. 77, 161-168 (2005).

Research Article

Bipartite dominating sets in hypercubes

Ramras, Mark

Ars Comb. 77, 169-180 (2005).

Research Article

Graph operations and point-distinguishing chromatic indices

Chiang, Nam-Po; Huang, Mao-Feng

Ars Comb. 77, 181-192 (2005).

Research Article

Comparison of convex hulls and box hulls

Boros, Endre; Gurvich, Vladimir; Liu, Ying

Ars Comb. 77, 193-204 (2005).

Research Article

On a generalization of signed total dominating functions of graphs

Xing, Huaming; Sun, Liang; Chen, Xuegang

Ars Comb. 77, 205-215 (2005).

Research Article

Matricial construction of k-colourings on square lattice

Marín, J. M.; Márquez, A.; Revuelta, M. P.

Ars Comb. 77, 217-232 (2005).

Research Article

Ozeki polynomials and Jacobi forms

Betsumiya, Koichi; Choie, YoungJu

Ars Comb. 77, 233-244 (2005).

Research Article

On the cordiality of the \(t\)-ply \(P_{t}(u,v)\)

Andar, Mahesh; Boxwala, Samina; Limaye, N. B.

Ars Comb. 77, 245-259 (2005).

Research Article

Applications related to the generalized Seidel matrix

Chen, Kwang-Wu

Ars Comb. 77, 261-272 (2005).

Research Article

Avoidable sets in the bicyclic inverse semigroup

Sieben, Nándor

Ars Comb. 77, 273-288 (2005).

Research Article

Average distance in \(k\)-connected tournaments

Dankelmann, P.; Volkmann, L.

Ars Comb. 77, 289-294 (2005).

Research Article

Embedding a restricted class of partial \(K_{4}\)-designs

Jenkins, Peter

Ars Comb. 77, 295-303 (2005).

Research Article

Hamilton paths in certain arithmetic graphs

Russell, Paul A.

Ars Comb. 77, 305-309 (2005).

Research Article

An efficient algorithm for cyclic edge connectivity of regular graphs

Lou, Dingjun; Wang, Wei

Ars Comb. 77, 311-318 (2005).

E-mail Alert

Add your e-mail address to receive upcoming issues of Ars Combinatoria.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;