This volume of conference proceedings contains selected papers on graph theory and other areas of combinatorics. The contributors include some of the leading names in discrete mathematics research, such as Frank Harary, Doug West, Joel Spencer and Paul Edros.
Self-Dual Embeddings of the Composition of Bipartite Graphs (M. Abu-Sbeih).
The q -Perfect Graphs (C. Berge).
On Generalized Location-Domination (D. Carson).
On Generalizations of Vertex Connectivity in n -Cube Networks (H.-A.
Choi & A. Oh).
On the Pure Edge-Integrity of Graphs (K. Bagga & J. Deogun).
c -Critical Graphs with Maximum Degree Three (M. Fiol).
The Smallest Graph Containing Copies of a Cycle (N. Graham).
Survey of Fault Tolerance for Graphs (F. Harary & J. Hayes).
On Iterated Line Graphs (E. Jarrett).
A Lower Bound for Oblivious Sorting (W. Kirchherr).
Reduction Towards Collapsibility (H.-J.
On Edge-Balanced Graphs (M. Kong & S.-M.
Connectivity of Double Vertex Graphs (Y. Alavi, et al.).
Embeddings in Tensor Product Graphs (T. Dakić, et al.).
A Survey of Results on Primal Graphs (J. Preen).
Graphs with Few Cliques (E. Prisner).
On Group Invariant Flows and Applications (F. Shahrokhi & L. Szekely).
Sequential Covering Designs (W. Wallis).
Domination in the Queen's Graph (W. Weakley).
Parsimonious 2-Multigraphs (T. Will & D. West).
Number Of Pages: 1268
Published: 3rd April 1995
Dimensions (cm): 24.2 x 16.4 x 3.5
Weight (kg): 2.128