Author(s): D. J. A. Welsh (ed.)
Publisher: Academic Press
Year: 1971
Language: English
City: London
Title
Contributors
Preface
Contents
Mehdi Behzad: The Total Chromatic Number of a Graph: a Survey
D. A. Bell: An Introductory Review of Error-Correcting Codes
Norman Biggs: Intersection Matrices for Linear Graphs
Béla Bollobás: Graphs with Given Diameter and Maximal Valency and with a Minimal Number of Edges
Richard A. Brualdi: A General Theorem Concerning Common Transversals
R. O. Davies: Ramsey’s Theorem and a Peculiar Classification of Subsets
M. A. H. Dempster: Two Algorithms for the Time-table Problem
J. de Sousa: Disjoint Common Transversals
G. A. Dirac: Menger’s Theorem and Related Topics
P. Erdös: Some Unsolved Problems in Graph Theory and Combinatorial Analysis
J. A. Formby: A Computer Procedure for Bounding the Chromatic Number of a Graph
H. O. Foulkes: Linear Graphs and Schur-functions
Richard K. Guy: Unsolved Combinatorial Problems
R. Halin: Studies on Minimally n-connected Graphs
A. J. W. Hilton: An Intersection Theorem for Two Families of Finite Sets
A. W. Ingleton: Representation of Matroids
M. Lewin: Minimal Coverings of Matrices
Fred Lunnon: The IU Function: the Size of a Free Distributive Lattice
John McKay: Multi-Dimensional Partition
J. W. Moon: Four Combinatorial Problems
C. St.J. A. Nash-Williams: Possible Directions in Graph Theory
T. A. J. Nicholson: A Method for Optimizing Permutation Problems and its Industrial Applications
Hazel Perfect: Menger’s Graph Theorem in Relation to Transversal Theory
Roger Penrose: Applications of Negative Dimensional Tensors
J. S. Pym: A Lattice of Separating Sets in a Graph
R. Rado: A Theorem on Chains of Finite Sets (11)
B. C. Rennie: Some Problems of Combinatorial geometry
Norbert Sauer: The Largest Number of Edges of a Graph such that not more than g Intersect in a Point or more than n are Independent
Cedric A. B. Smith: Map Colourings and Linear Mappings
W. Vollmerhaus: Graph Theoretical Methods in Diffusion Theory
D. J. A. Welsh: Combinatorial Problems in Matroid Theory
Herbert S. Wilf: The Friendship Theorem
Herbert S. Wilf: An Analogue of the Chromatic Polynomial for Vertex Assignments Modulo 3
Robin J. Wilson: The Möbius Function in Combinatorial Mathematics
D. R. Woodall: Thrackles and Deadlock
D. R. Woodall: Square lambda-Linked Designs: a Survey
Author Index
Subject Index
