On the connectivity and superconnectivity of bipartite digraphs and graphs
Balbuena, C.; Carmona, A.
Ars Comb. 61, 3-21 (2001).
Vertex-disjoint paths in graphs
Egawa, Yoshimi; Ota, Katsuhiro
Ars Comb. 61, 23-31 (2001).
Stable and unstable graphs with total irredundance number zero
Haynes, Teresa W.; Hedetniemi, Stephen T.; Henning, Michael A.; Knisley, Debra J.
Ars Comb. 61, 34-46 (2001).
The edge-isoperimetric problem for regular planar tesselations
Harper, L. H.
Ars Comb. 61, 47-63 (2001).
On zero sum subsequences of restricted size. III
Gao, W. D.
Ars Comb. 61, 65-72 (2001).
Maximum number of 3-paths in a graph
Byer, Owen D.
Ars Comb. 61, 73-79 (2001).
Double orderings of \((0,1)\)-matrices
Mader, Adolf; Mutzbauer, Otto
Ars Comb. 61, 81-95 (2001).
n-color analogues of Gaussian polynomials
Agarwal, A. K.
Ars Comb. 61, 97-117 (2001).
Neighborhood union condition with distance for vertex-pancyclicity
Lin, Wensong; Song, Zengmin
Ars Comb. 61, 119-127 (2001).
On α-valuations of disconnected graphs
El-Zanati, Saad; Vanden Eynden, Charles
Ars Comb. 61, 129-136 (2001).
Realizability of p-point, q-line graphs with prescribed maximum degree, and point connectivity
DiMarco, D.
Ars Comb. 61, 137-147 (2001).
Lexicographically optimum traffic trees with maximum degree constraints
Anazawa, Tsutomu
Ars Comb. 61, 149-160 (2001).
On the toughness of the total graph of a graph
Nihei, Masakazu
Ars Comb. 61, 161-165 (2001).
Tough-maximum graphs
Choudum, S. A.; Priya, N.
Ars Comb. 61, 167-172 (2001).
Isomorphisms of cyclic abelian covers of symmetric digraphs. III
Sato, Iwao
Ars Comb. 61, 173-186 (2001).
Families of matrices with good auto and cross-correlation
Hall, T. E.; Osborne, C. F.; Tirkel, A. Z.
Ars Comb. 61, 187-196 (2001).
Minimizing β+Δ and well covered graphs
Brewster, Richard C.; MacGillivray, Gary
Ars Comb. 61, 197-210 (2001).
2-reducible paths containing a specified edge in (2k+1)-edge-connected graphs
Okamura, Haruko
Ars Comb. 61, 211-220 (2001).
Decoding Goppa codes with MAGMA
Faina, Giorgio; Giulietti, Massimo
Ars Comb. 61, 221-232 (2001).
No-hole 2-distant colorings for unit interval graphs
Chang, Gerard J.; Juan, Su-tzu; Liu, Daphne D.-F.
Ars Comb. 61, 233-244 (2001).
The intersection problem for twin bowtie and near bowtie systems
Lo Faro, Giovanni; Tripodi, Antoinette
Ars Comb. 61, 245-254 (2001).
Isomorphic antidirected path decompositions of complete symmetric graphs
Shyu, Tay-Woei; Lin, Chiang
Ars Comb. 61, 255-262 (2001).
Classification of the \([n,3,n−3]q\) NMDS codes over \(GF(7)\), \(GF(8)\) and \(GF(9)\)
Marcugini, Stefano; Milani, Alfredo; Pambianco, Fernanda
Ars Comb. 61, 263-269 (2001).
Some families of elegant and harmonious graphs
Deb, Parag K.; Limaye, N. B.
Ars Comb. 61, 271-286 (2001).
Smallest weak and smallest totally weak critical sets in the Latin squares of order at most seven
Adams, Peter; Khodkar, Abdollah
Ars Comb. 61, 287-300 (2001).
Balanced bipartite row-column designs
Parsad, Rajender; Gupta, V. K.
Ars Comb. 61, 301-312 (2001).
Cyclic and rotational decompositions of \(K_{n}\) into stars
Gardner, Robert B.
Ars Comb. 61, 313-318 (2001).
