Graph theory with applications to algorithms and computer science

Abstract

Partial table of contents: Finite Figures Consisting Of Regular Polygons (J. Akiyama, et al.). Eigenvalues, Geometric Expanders and Sorting in Rounds (N. Alon). Long Path Enumeration Algorithms for Timing Verification on Large Digital Systems (T. Asano and S. Sato). On Upsets in Bipartite Tournaments (K. Bagga). Some Results on Binary Matrices Obtained via Bipartite Tournaments (K. Bagga and L. Beineke). Partitioning the Nodes of a Graph (E. Barnes). A Graph Theoretical Characterization of Minimal Deadlocks in Petri Nets (J. Bermond and G. Memmi). On Graceful Directed Graphs that Are Computational Models of Some Algebraic Systems (G. Bloom and D. Hsu). The Cut Frequency Vector (F. Boesch). Diameter Vulnerability in Networks (J. Bond and C. Peyrat). Generalized Colorings of Outerplanar and Planar Graphs (I. Broere and C. Mynhardt). The Ramsey Number for the Pair Complete Bipartite Graph-Graph of Limited Degree (S. Burr, et al.). Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (F. Chung). Hamilton Cycles and Quotients of Bipartite Graphs (I. Dejter). Problems and Results on Chromatic Numbers in Finite and Infinite Graphs (P. Erdos). Supraconvergence and Functions that Sum to Zero on Cycles (V. Faber and A. White, Jr.). Edge-Disjoint Hamiltonian Cycles (R. Faudree, et al.). Studies Related to the Ramsey Number r(K d5 u - e) (R. Faudree, et al). The Structural Complexity of Flowgraphs (N. Fenton). n-Domination in Graphs (J. Fink and M. Jacobson).