Graph Theory, Combinatorics and Applications: Vols 1-2
Published on 28. March 1991
Book
Hardback
1192 pages
978-0-471-53245-3 (ISBN)
Description
This two-volume set contains a collection of original papers presented at a conference on the subject of graphs, held in June 1988. Recent research in both the theory and applications of graph theory and combinatorics is presented.
More details
Edition
Volume Set ed.
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Professional and scholarly
Illustrations
Ill.
Dimensions
Height: 82 mm
Width: 59 mm
Weight
2495 gr
ISBN-13
978-0-471-53245-3 (9780471532453)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Content
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).