Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity [E-Book] / edited by Jaroslav Nesetril, Miroslav Fiedler.
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 abl...
Saved in:
Full text |
|
Personal Name(s): | Fiedler, Miroslav. |
Nesetril, Jaroslav. | |
Imprint: |
Amsterdam ; New York :
North-Holland,
1992
|
Physical Description: |
1 online resource (ix, 400 p.) : ill. |
Note: |
englisch |
ISBN: |
9780444895431 0444895434 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Annals of discrete mathematics ;
51 |
Subject (LOC): |
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. |