Topics in Combinatorics and Graph Theory

Essays in Honour of Gerhard Ringel

  • Rainer Bodendiek
  • Rudolf Henn

Table of contents

  1. Front Matter
    Pages I-XIX
  2. R. Bodendiek, K. Wagner
    Pages 1-27
  3. M. Aigner, E. Triesch
    Pages 29-36
  4. B. Alspach, J. C. George
    Pages 41-46
  5. J. André
    Pages 47-57
  6. N. L. Biggs, E. K. Lloyd, R. J. Wilson
    Pages 93-99
  7. D. Bauer, H. J. Broersma, H. J. Veldman
    Pages 101-110
  8. U. Baumann, M. Lesch, I. Schmeichel
    Pages 117-128
  9. A. Bouchet, B. Mohar
    Pages 129-135
  10. O. V. Borodin
    Pages 137-144
  11. A. Brandstädt
    Pages 145-152
  12. U. Brehm
    Pages 153-162

About this book

Introduction

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.

Keywords

combinatorics discrete mathematics graph theory

Editors and affiliations

  • Rainer Bodendiek
    • 1
  • Rudolf Henn
    • 2
  1. 1.Institut für Mathematik und ihre DidaktikPädagogische Hochschule KielKielGermany
  2. 2.Institut für Statistik und Mathematische WirtschaftstheorieUniversität KarlsruheKarlsruheGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-46908-4
  • Copyright Information Physica-Verlag Heidelberg 1990
  • Publisher Name Physica-Verlag HD
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-46910-7
  • Online ISBN 978-3-642-46908-4
  • About this book