Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity / edited by Jaroslav Nešetřil, Miroslav Fiedler.
Series: Annals of discrete mathematics ; 51.1992Description: 1 online resource (ix, 400 pages) : illustrationsContent type:- text
- computer
- online resource
- 9780444895431
- 0444895434
- 9780080867915
- 008086791X
- 1281778915
- 9781281778918
- Combinatorial analysis -- Congresses
- Graph theory -- Congresses
- Computational complexity -- Congresses
- Analyse combinatoire -- Congrès
- Graphes, Théorie des -- Congrès
- Complexité de calcul (Informatique) -- Congrès
- MATHEMATICS -- Combinatorics
- Combinatorial analysis
- Computational complexity
- Graph theory
- Analyse combinatoire -- Congrès
- Graphes, théorie des -- Congrès
- Complexité de calcul (Informatique) -- Congrès
- Combinatorial mathematics
- QA164 .C94 1990eb
eBooks
This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.
Includes bibliographical references and indexes.
Print version record.
Front Cover; Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity; Copyright Page; Preface; Contents; Chapter 1. Two Sequences of 2-Regular Graceful Graphs Consisting of 4-gons; Chapter 2. A Survey of Self-Dual Polyhedra; Chapter 3. On Magic Labellings of Convex Polytopes; Chapter 4. A Packing Problem and Geometrical Series; Chapter 5. On the Bananas Surface B2; Chapter 6. Structural Properties and Colorings of Plane Graphs; Chapter 7. The Binding Number of Graphs; Chapter 8. Note on Algorithmic Solvability of Trahtenbrot-Zykov Problem.
Elsevier ScienceDirect All Books