Book contents
- Frontmatter
- Contents
- Preface
- Papers contributed by the participants
- Perfect codes and distance-transitive graphs
- Generalisation of Fisher's inequality to fields with more than one element
- On balanced arrays
- Positions in Room squares
- Analogues of Heawood's theorem
- Cut-set lattices of graphs
- On the chromatic index of a graph, II.
- On a theorem of R. A. Liebler
- Outerthickness and outercoarseness of graphs
- Graphs with homeomorphically irreducible spanning trees
- A note on embedding latin rectangles
- Some results in semi-stable graphs
- Hereditary properties and P-chromatic numbers
- Some problems concerning complete latin squares
- Necklace enumeration with adjacency restrictions
- On a family of planar bicritical graphs
- On the enumeration of partially ordered sets of integers
- The distance between nodes in recursive trees
- Partition relations
- On a problem of Daykin concerning intersecting families of sets
- Unstable trees
- Distance-transitive graphs
- Enumeration of graphs on a large periodic lattice
- Some polynomials associated with graphs
- Equidistant point sets
- Eigenvalues of graphs and operations
- Graph theory and algebraic topology
- Applications of polymatroids and linear programming to transversals and graphs
- Problem section
The distance between nodes in recursive trees
Published online by Cambridge University Press: 05 April 2013
By
Book contents
- Frontmatter
- Contents
- Preface
- Papers contributed by the participants
- Perfect codes and distance-transitive graphs
- Generalisation of Fisher's inequality to fields with more than one element
- On balanced arrays
- Positions in Room squares
- Analogues of Heawood's theorem
- Cut-set lattices of graphs
- On the chromatic index of a graph, II.
- On a theorem of R. A. Liebler
- Outerthickness and outercoarseness of graphs
- Graphs with homeomorphically irreducible spanning trees
- A note on embedding latin rectangles
- Some results in semi-stable graphs
- Hereditary properties and P-chromatic numbers
- Some problems concerning complete latin squares
- Necklace enumeration with adjacency restrictions
- On a family of planar bicritical graphs
- On the enumeration of partially ordered sets of integers
- The distance between nodes in recursive trees
- Partition relations
- On a problem of Daykin concerning intersecting families of sets
- Unstable trees
- Distance-transitive graphs
- Enumeration of graphs on a large periodic lattice
- Some polynomials associated with graphs
- Equidistant point sets
- Eigenvalues of graphs and operations
- Graph theory and algebraic topology
- Applications of polymatroids and linear programming to transversals and graphs
- Problem section
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Combinatorics , pp. 125 - 132Publisher: Cambridge University PressPrint publication year: 1974
- 19
- Cited by