Volume 61,
September 2001
- Camino Balbuena, Angeles Carmona:
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs.
- Yoshimi Egawa, Katsuhiro Ota:
Vertex-Disjoint Paths in Graphs.
- Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Stable and unstable graphs with total irredundance number zero.
- L. H. Harper:
The Edge-Isoperimetric Problem for Regular Planar Tesselations.
- Weidong Gao:
On Zero Sum Subsequences of Restricted Size III.
- Owen D. Byer:
Maximum number of 3-paths in a graph.
- Adolf Mader, Otto Mutzbauer:
Double Orderings of (0, 1)-Matrices.
- A. K. Agarwal:
n-Color Analogues of Gaussian Polynomials.
- Wensong Lin, Zengmin Song:
Neighborhood Union Condition with Distance for Vertex-pancyclicity.
- Saad El-Zanati, Charles Vanden Eynden:
On a-valuations of disconnected graphs.
- D. DiMarco:
Realizability of p-Point, q-Line Graphs with Prescribed Maximum Degree, and Point Connectivity.
- Tsutomu Anazawa:
Lexicographically Optimum Traffic Trees with Maximum Degree Constraints.
- Masakazu Nihei:
On the Toughness of the Total Graph of a Graph.
- Sheshayya A. Choudum, N. Priya:
Tough-Maximum Graphs.
- Iwao Sato:
Isomorphisms of Cyclic Abelian Covers of Symmetric Digraphs, III.
- Thomas E. Hall, C. F. Osborne, Andrew Z. Tirkel:
Families of Matrices with Good Auto and Cross-Correlation.
- Richard C. Brewster, Gary MacGillivray:
Minimizing b + D and well covered graphs.
- Haruko Okamura:
2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.
- Giorgio Faina, Massimo Giulietti:
Decoding Goppa Codes with MAGMA.
- Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
No-hole 2-distant colorings for unit interval graphs.
- Giovanni Lo Faro, Antoinette Tripodi:
The intersection problem for twin bowtie and near bowtie systems.
- Tay-Woei Shyu, Chiang Lin:
Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs.
- Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9).
- Parag K. Deb, Nirmala B. Limaye:
Some Families of Elegant and Harmonious Graphs.
- Peter Adams, Abdollah Khodkar:
Smallest weak and smallest totally weak critical set in the latin squares of order at most seven.
- Rajender Parsad, V. K. Gupta:
Balanced Bipartite Row-Column Designs.
- Robert B. Gardner:
Cyclic and Rotational Decompositions of K_n into Stars.
Copyright © Fri Dec 4 20:27:17 2009
by Michael Ley (ley@uni-trier.de)
