
Theory and Practice of Combinatorics
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
More details
Other editions
Additional editions
Content
- Front Cover
- Theory and Practive of Combinatorics: A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday
- Copyright Page
- Contents
- Preface
- Chapter 1. Bounds for the sizes of components in perfect systems of difference sets
- Chapter 2. Crossing-free subgraphs
- Chapter 3. A note on the number of 4-circuits in a tournament
- Chapter 4. On graphs which contain all sparse graphs
- Chapter 5. Representation of group elements as short products
- Chapter 6. Some common properties for regularizable graphs, edgecritical graphs and B-graphs
- Chapter 7. Skew Hadamard matrices of order 16
- Chapter 8. Sur un problème combinatoire d'antennes en radioastronomie II
- Chapter 9. Un algorithme de construction des idempotents primitifs d'ideaux d'algèbres sur Fq
- Chapter 10. Kotzig factorizations: existence and computational results
- Chapter 11. Character strings as directed Euler paths
- Chapter 12. On maximal equidistant permutation arrays
- Chapter 13. Domino squares
- Chapter 14. Some problems on additive number theory
- Chapter 15. On almost bipartite large chromatic graphs
- Chapter 16. Covering graphs by equivalence relations
- Chapter 17. Analogues for tilings of Kotzig's theorem on minimal weights of edges
- Chapter 18. Sets of integers whose subsets have distinct sums
- Chapter 19. Analogues of the Shannon capacity of a graph
- Chapter 20. On partially resolvable t- partitions
- Chapter 21. Decompositions of complete graphs defined by quasigroups
- Chapter 22. Regular perfect systems of difference sets of size 4 and extremal systems of size 3
- Chapter 23. A note on one-factorizations having a prescribed number of edges in common
- Chapter 24. Systemes de transition et coloriages eulériens
- Chapter 25. Regular and strongly regular selfcomplementary graphs
- Chapter 26. Construction of additive sequences of permutations of arbitrary lengths
- Chapter 27.Counting rooted triangulations
- Chapter 28. Non-Hamiltonian simple planar graphs
- Annals of Discrete Mathematics Previous Volumes in this Series
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.