Cargando…
Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity /
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor Corporativo: | |
| Otros Autores: | , |
| Formato: | Electrónico Congresos, conferencias eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York :
North-Holland,
1992.
|
| Colección: | Annals of discrete mathematics ;
51. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn316553070 | ||
| 003 | OCoLC | ||
| 005 | 20231117015227.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 090320s1992 ne a ob 101 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d OCLCF |d DEBBG |d OCLCO |d N$T |d IDEBK |d E7B |d MERUC |d YDXCP |d OCLCO |d OCLCQ |d OCL |d OCLCO |d OCLCQ |d DEBSZ |d OCLCQ |d LEAUB |d INARC |d OCLCQ |d S2H |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 307709493 |a 646773875 |a 823838628 |a 823906938 |a 824096395 |a 824149065 |a 1149241372 | ||
| 020 | |a 9780444895431 | ||
| 020 | |a 0444895434 | ||
| 020 | |a 9780080867915 |q (electronic bk.) | ||
| 020 | |a 008086791X |q (electronic bk.) | ||
| 020 | |a 1281778915 | ||
| 020 | |a 9781281778918 | ||
| 035 | |a (OCoLC)316553070 |z (OCoLC)307709493 |z (OCoLC)646773875 |z (OCoLC)823838628 |z (OCoLC)823906938 |z (OCoLC)824096395 |z (OCoLC)824149065 |z (OCoLC)1149241372 | ||
| 050 | 4 | |a QA164 |b .C94 1990eb | |
| 072 | 7 | |a MAT |x 036000 |2 bisacsh | |
| 072 | 7 | |a PBV |2 bicssc | |
| 082 | 0 | 4 | |a 511/.6 |2 22 |
| 111 | 2 | |a Czechoslovakian Symposium on Combinatorics, Graphs and Complexity |n (4th : |d 1990 : |c Prachatice, Czechoslovakia) | |
| 245 | 1 | 0 | |a Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity / |c edited by Jaroslav Ne�set�ril, Miroslav Fiedler. |
| 260 | |a Amsterdam ; |a New York : |b North-Holland, |c 1992. | ||
| 300 | |a 1 online resource (ix, 400 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Annals of discrete mathematics ; |v 51 | |
| 520 | |a 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. | ||
| 504 | |a Includes bibliographical references and indexes. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a 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. | |
| 650 | 0 | |a Combinatorial analysis |v Congresses. | |
| 650 | 0 | |a Graph theory |v Congresses. | |
| 650 | 0 | |a Computational complexity |v Congresses. | |
| 650 | 6 | |a Analyse combinatoire |0 (CaQQLa)201-0024152 |v Congr�es. |0 (CaQQLa)201-0378219 | |
| 650 | 6 | |a Th�eorie des graphes |0 (CaQQLa)201-0024153 |v Congr�es. |0 (CaQQLa)201-0378219 | |
| 650 | 6 | |a Complexit�e de calcul (Informatique) |0 (CaQQLa)201-0068287 |v Congr�es. |0 (CaQQLa)201-0378219 | |
| 650 | 7 | |a MATHEMATICS |x Combinatorics. |2 bisacsh | |
| 650 | 7 | |a Combinatorial analysis |2 fast |0 (OCoLC)fst00868961 | |
| 650 | 7 | |a Computational complexity |2 fast |0 (OCoLC)fst00871991 | |
| 650 | 7 | |a Graph theory |2 fast |0 (OCoLC)fst00946584 | |
| 650 | 7 | |a Analyse combinatoire |x Congr�es. |2 ram | |
| 650 | 7 | |a Graphes, th�eorie des |x Congr�es. |2 ram | |
| 650 | 7 | |a Complexit�e de calcul (Informatique) |x Congr�es. |2 ram | |
| 653 | 0 | |a Combinatorial mathematics | |
| 655 | 2 | |a Congress |0 (DNLM)D016423 | |
| 655 | 7 | |a proceedings (reports) |2 aat |0 (CStmoGRI)aatgf300027316 | |
| 655 | 7 | |a Conference papers and proceedings |2 fast |0 (OCoLC)fst01423772 | |
| 655 | 7 | |a Conference papers and proceedings. |2 lcgft | |
| 655 | 7 | |a Actes de congr�es. |2 rvmgf |0 (CaQQLa)RVMGF-000001049 | |
| 700 | 1 | |a Ne�set�ril, Jaroslav. | |
| 700 | 1 | |a Fiedler, Miroslav. | |
| 776 | 0 | 8 | |i Print version: |a Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (4th : 1990 : Prachatice, Czechoslovakia). |t Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity. |d Amsterdam ; New York : North-Holland, 1992 |z 0444895434 |z 9780444895431 |w (DLC) 92014160 |w (OCoLC)25710840 |
| 830 | 0 | |a Annals of discrete mathematics ; |v 51. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780444895431 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=01675060&volume=51 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/01675060/51 |z Texto completo |