Topics in Combinatorics and Graph Theory

1. Front Matter

   Pages I-XIX

   PDF

2. On the Problem of Relative Components of Minimal Graphs

   • R. Bodendiek, K. Wagner

   Pages 1-27

3. Irregular Assignments and Two Problems à la Ringel

   • M. Aigner, E. Triesch

   Pages 29-36

4. A Recursive Bound for the Number of Complete K-Subgraphs of a Graph

   • R. Ahlswede, N. Cai, Z. Zhang

   Pages 37-39

5. One-Factorizations of Tensor Products of Graphs

   • B. Alspach, J. C. George

   Pages 41-46

6. Non-Commutative Geometry and Graphs

   • J. André

   Pages 47-57

7. The Complexity of the Graph Embedding Problem

   • D. Archdeacon

   Pages 59-64

8. Helly Theorems for Dismantlable Graphs and Pseudo-Modular Graphs

   • H.-J. Bandelt, H. M. Mulder

   Pages 65-71

9. On the Level-Oriented Two-Dimensional Packing With Rotation of the Rectangles

   • G. Bär

   Pages 73-78

10. On Planar Tilings With Finitely Many Sorts of Tiles

    • K. Bezdek

    Pages 79-85

11. Examples of Space-Tiling Polyhedra Related to Hilbert’s Problem 18, Question 2

    • A. Bezdek, W. Kuperberg

    Pages 87-92

12. The Historical Background to Gerhard Ringel’s Work

    • N. L. Biggs, E. K. Lloyd, R. J. Wilson

    Pages 93-99

13. Around Three Lemmas in Hamiltonian Graph Theory

    • D. Bauer, H. J. Broersma, H. J. Veldman

    Pages 101-110

14. A Note on Metric Properties of Infinite Graphs

    • T. Böhme

    Pages 111-115

15. Automorphism Groups of Directed Cayley Graphs

    • U. Baumann, M. Lesch, I. Schmeichel

    Pages 117-128

16. Triangular Embeddings of Tensor Products of Graphs

    • A. Bouchet, B. Mohar

    Pages 129-135

17. Computing Light Edges in Planar Graphs

    • O. V. Borodin

    Pages 137-144

18. On the Domination Problem for Bipartite Graphs

    • A. Brandstädt

    Pages 145-152

19. Polyhedral Maps with Few Edges

    • U. Brehm

    Pages 153-162

20. Aut G _m,n for the Hasse Graph G _m,n of the Subword Poset B _m,n of an m-Ary Cyclic Word of Length n

    • G. Burosch, J.-M. Laborde

    Pages 163-174

Graph Theory is a part of discrete mathematics characterized by the fact of an extremely rapid development during the last 10 years. The number of graph theoretical paper as well as the number of graph theorists increase very strongly. The main purpose of this book is to show the reader the variety of graph theoretical methods and the relation to combinatorics and to give him a survey on a lot of new results, special methods, and interesting informations. This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.

• combinatorics
• discrete mathematics
• graph theory

• Institut für Mathematik und ihre Didaktik, Pädagogische Hochschule Kiel, Kiel, Germany

  Rainer Bodendiek

• Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe, Karlsruhe, Germany

  Rudolf Henn

Policies and ethics