Graph Theory, Combinatorics and Applications

Partial table of contents: A Characterization of the Sequence of Generalized Chromatic Numbers of a Graph (I. Broere & M. Frick). Optimal Communication Trees with Application to Hypercube Multicomputers (H. Choi, et al.). On an Extension of a Conjecture of I. H?vel (I. Dejter & J. Quintana). Odd Cycles in Graphs of Given Minimum Degree (P. Erd?s, et al.). Lexicographically Factorable Extensions of Irreducible Graphs (J. Feigenbaum). On m-Connected and k-Neighbor-Connected Graphs (G. Gunther & B. Hartnell). On Graphs with (I,n)-Regular Induced Subgraphs (M. Henning, et al.). Graph Transforms: A Formalism for Modeling Chemical Reaction Pathways (M. Johnson). An Algorithm to Decide If a Cayley Diagram Is Planar (H. Levinson). The Laplacian Spectrum of Graphs (B. Mohar). Random Superposition: Multigraphs (E. Palmer). From Garbage to Rainbows: Generalizations of Graph Coloring and Their Applications (F. Roberts). Symmetric Embeddings of Cayley Graphs in Nonorientable Surfaces (T. Tucker).