Preface 1. Perfect codes and distance-transitive graphs N. Biggs 2. Generalisation of Fisher's inequality to fields with more than one element P. J. Cameron 3. On balanced arrays D. V. Chopra 4. Positions in Room squares R. L. Constable 5. Analogues of Heawood's theorem R. J. Cook 6. Cut-set lattices of graphs F. Escalante 7. On the chromatic index of a graph, II. S. Fiorini and R. J. Wilson 8. On a theorem of R. A. Liebler A. Gardiner 9. Outerthickness and outercoarseness of graphs R. K. Guy 10. Graphs with homeomorphically irreducible spanning trees A. Hill 11. A note on embedding latin rectangles A. J. W. Hilton 12. Some results in semi-stable graphs D. A. Holton 13. Hereditary properties and P-chromatic numbers R. P. Jones 14. Some problems concerning complete latin squares A. D. Keedwell 15. Necklace enumeration with adjacency restrictions E. K. Lloyd 16. On a family of planar bicritical graphs L. Lovasz and M. D. Plummer 17. On the enumeration of partially ordered sets of integers J. C. P. Miller 18. The distance between nodes in recursive trees J. W. Moon 19. Partition relations R. Nelson 20. On a problem of Daykin concerning inter secting families of sets J. Schonheim 21. Unstable trees J. Sheehan 22. Distance-transitive graphs D. H. Smith 23. Enumeration of graphs on a large periodic lattice H. N. V. Temperley 24. Some polynomials associated with graphs W. T. Tutte 25. Equidistant point sets J. H. van Lint 26. Figenvalues of graphs and operations D. A. Waller 27. Graph theory and algebraic topology R. J. Wilson 28. Applications of polymatroids and linear programming to transversals and graphs D. R. Woodall Problem section.
Preface 1. Perfect codes and distance-transitive graphs N. Biggs 2. Generalisation of Fisher's inequality to fields with more than one element P. J. Cameron 3. On balanced arrays D. V. Chopra 4. Positions in Room squares R. L. Constable 5. Analogues of Heawood's theorem R. J. Cook 6. Cut-set lattices of graphs F. Escalante 7. On the chromatic index of a graph, II. S. Fiorini and R. J. Wilson 8. On a theorem of R. A. Liebler A. Gardiner 9. Outerthickness and outercoarseness of graphs R. K. Guy 10. Graphs with homeomorphically irreducible spanning trees A. Hill 11. A note on embedding latin rectangles A. J. W. Hilton 12. Some results in semi-stable graphs D. A. Holton 13. Hereditary properties and P-chromatic numbers R. P. Jones 14. Some problems concerning complete latin squares A. D. Keedwell 15. Necklace enumeration with adjacency restrictions E. K. Lloyd 16. On a family of planar bicritical graphs L. Lovasz and M. D. Plummer 17. On the enumeration of partially ordered sets of integers J. C. P. Miller 18. The distance between nodes in recursive trees J. W. Moon 19. Partition relations R. Nelson 20. On a problem of Daykin concerning inter secting families of sets J. Schonheim 21. Unstable trees J. Sheehan 22. Distance-transitive graphs D. H. Smith 23. Enumeration of graphs on a large periodic lattice H. N. V. Temperley 24. Some polynomials associated with graphs W. T. Tutte 25. Equidistant point sets J. H. van Lint 26. Figenvalues of graphs and operations D. A. Waller 27. Graph theory and algebraic topology R. J. Wilson 28. Applications of polymatroids and linear programming to transversals and graphs D. R. Woodall Problem section.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
