Double circulant self-dual codes over \(GF(5)\)
Gulliver, T. Aaron; Harada, Masaaki
Ars Comb. 56, 3-13 (2000).
Further results on independence in direct-product graphs
Jha, Pranava K.
Ars Comb. 56, 15-24 (2000).
Induced graph theorem on magic valuation
Enomoto, H.; Masuda, K.; Nakamigawa, T.
Ars Comb. 56, 25-32 (2000).
Ramsey sets for matchings
Mengersen, I.; Oeckermann, J.
Ars Comb. 56, 33-42 (2000).
Further results on almost Moore digraphs
Baskoro, Edy Tri; Miller, Mirka; Plesník, Ján
Ars Comb. 56, 43-63 (2000).
\(T\)-colorings and chromatic number of distance graphs
Liu, Daphne Der-Fen
Ars Comb. 56, 65-80 (2000).
Square-celled animal reconstruction problems
Maynard, Philip
Ars Comb. 56, 81-87 (2000).
Dimensions for cographs
McKee, Terry A.
Ars Comb. 56, 89-95 (2000).
Cops, robber, and photo radar
Clarke, Nancy E.; Nowakowski, Richard J.
Ars Comb. 56, 97-103 (2000).
New binary linear codes
Gulliver, T. Aaron; Östergård, Patric R. J.
Ars Comb. 56, 105-112 (2000).
A syndrome-distribution decoding of MOLS \(L_{p}\) codes
Kim, D. G.; Hahn, S.; Kim, Y. S.
Ars Comb. 56, 113-120 (2000).
Lower bounds on dominating functions in graphs
Kang, Li-ying; Shan, Er-fang
Ars Comb. 56, 121-128 (2000).
On the decomposition of graphs into cliques
Bachelis, Gregory F.; Barcume, Troy; Su, Xiang-Ying
Ars Comb. 56, 129-131 (2000).
A new infinite series of double Youden rectangles
Vowden, B. J.
Ars Comb. 56, 133-145 (2000).
Hamiltonian paths in projective checkerboards
Forbush, Margaret H.
Ars Comb. 56, 147-160 (2000).
The domatic numbers of factors of graphs
Haynes, Teresa W.; Henning, Michael A.
Ars Comb. 56, 161-173 (2000).
On graphs with strong α-valuations
El-Zanati, Saad; Vanden Eynden, Charles
Ars Comb. 56, 175-188 (2000).
Improved bounds for the product of the domination and chromatic numbers of a graph
Caro, Y.; Roditty, Y.
Ars Comb. 56, 189-191 (2000).
Nilpotent SQS-skeins with nilpotent derived sloops
Armanious, M. H.
Ars Comb. 56, 193-200 (2000).
The expectation of independent domination number over random binary trees
Lee, Changwoo
Ars Comb. 56, 201-209 (2000).
Broadcasting in odd graphs
Aguiló, F.; González, J.; Simó, E.; Zaragozá, M.
Ars Comb. 56, 211-222 (2000).
Color switching games
Tollisen, Gregory P.; Lengyel, Tamás
Ars Comb. 56, 223-234 (2000).
Some nonbinary power residue codes
Gulliver, T. Aaron; Bhargava, Vijay K.
Ars Comb. 56, 235-245 (2000).
The mapping \(\overline {C} : G \rightarrow C(\overline {G})\),a new graph theoretic map
Lopez, Christian; Mueller, Ute A.
Ars Comb. 56, 247-256 (2000).
The \(k\)-th lower multiexponent of tournament matrices
Liu, Bolian; Wang, Yan
Ars Comb. 56, 257-262 (2000).
Cycles through specified vertices in \(1\)-tough graphs
Stacho, Ladislav
Ars Comb. 56, 263-269 (2000).
Covering the powers of the complete graph with a bounded number of snakes
Alsardary, Salar Y.
Ars Comb. 56, 289-298 (2000).
The fine structure of balanced ternary designs with block size three, index three and \(\rho_{2}=1,2\)
Adams, Peter; Bryant, Darryn E.; Khodkar, A.
Ars Comb. 56, 299-308 (2000).
Large neighbourhood unions and edge-disjoint perfect matchings
Sabourin, Sindi
Ars Comb. 56, 309-317 (2000).
