This is a test
- 308 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Combinatorics 79. Part II
Book details
Table of contents
Citations
About This Book
Combinatorics 79. Part II
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Combinatorics 79. Part II by M. Deza,I.G. Rosenberg in PDF and/or ePUB format, as well as other popular books in Matematica & Matematica discreta. We have over one million books available in our catalogue for you to explore.
Information
Topic
MatematicaSubtopic
Matematica discretaTable of contents
- Front Cover
- Annals of Discrete Mathematics Combinatorics 79, Part II
- Copyright Pageâ€
- Contents
- Chapter 1. Centers of 2-trees
- Chapter 2. The edge reconstructibility of planar bidegree graphs
- Chapter 3. The Hungarian magic cube puzzle
- Chapter 4. Complete lists of cubic graphs (Abstract)
- Chapter 5. Graphes cubiques d'indice chromatique quatre
- Chapter 6. Un problemĂš de coloration aux aspects varies
- Chapter 7. Mesures de centralité d'un graphe (Abstract)
- Chapter 8. Generalized Ramsey numbers involving subdivision graphs, and relative problems in graph theory
- Chapter 9. A general intersection theorem for finite sets
- Chapter 10. A new paradigm for duality questions (Abstract)
- Chapter 11. The complexity of a planar hypermap and that of its dualâ€
- Chapter 12. Acceptable orientations of graphs
- Chapter 13. An algebraic upper bound on the independence number of a graph (Abstract)
- Chapter 14. Preuve algebriqué du critÚre de planarite du Wu-Lin
- Chapter 15. Rediscovery and alternate proof of Gauss's identity
- Chapter 16. DĂ©composition d'un graphe en cycle et chaines
- Chapter 17. Théorie de la médiane dans les treillis distributifs finis et applications
- Chapter 18. Graphes noyau-parfaits
- Chapter 19. Threshold numbers and threshold completions
- Chapter 20. Quasimonotone Boolean functions and bistellar graphs
- Chapter 21. Minimal triangulations of polygonal domains
- Chapter 22. Graphs, groups and mandalas (Abstract)
- Chapter 23. Packing problems (Abst act)
- Chapter 24. Combinatorial decomposition and graphs realizability (Abst act)
- Chapter 25. Multipliers of sets in finite fields and Zn
- Chapter 26. Analogues for Sperner and Erdös-Ko-Rado theorems for sub-spaces of linear spaces (abstract)
- Chapter 27. Generalized principle of inclusion and exclusion and its applications
- Chapter 28. Les G-systĂšmes triples
- Chapter 29. Comment construire un graphe Pert minimal
- Chapter 30. Decomposing complete graphs into cycles of length 2pe
- Chapter 31. Une généralisation dans les p-groupes abéliens élémentaires, p>2, des théorÚmes de H.B. Mann et J.F. Dillon sur les ensembles à differences des 2-groupes abeliens elementaires
- Chapter 32. On correlations of finite Boolean lattices (Abstract)
- Chapter 33. Properties of (0, 1)-matrices with forbidden configurations
- Chapter 34. On adjacency matrices for hypergraphs (Abstract)
- Chapter 35. Prime triangular matrices of integers (Abstract)
- Chapter 36. Une généralisation d'un théorÚme de Goethals-Van Tilborg
- Chapter 37. The jump number of dags and posets: an introduction
- Chapter 38. The path-numbers of some multipartite graphs
- Chapter 39. A construction method for minimally k-edge-connected graphs
- Chapter 40. The automorphism group of a matroid
- Chapter 41. Combinatorial aspects of continued fractions
- Chapter 42. The asymptotic behavior of a class of counting functions (Abstract)
- Chapter 43. The theorem of Whitney and the four colours conjecture (Abstract)
- Chapter 44. Non Hamiltonian cubic planar graphs having just two types of faces
- Chapter 45. Conjucturally stable coalition structures
- Chapter 46. Unit distance graphes in rational n-space (Abstract)
- Chapter 47. Counting three-connected graphs (Abstract)
- Chapter 48. Characterizing hypercubes
- Chapter 49. Sur les orientations acycliques des géométries orientees de rang trois
- Chapter 50. Applications of the GordonâStiemke theorem in combinatorial matrix theory (Abstract)
- Chapter 51. Necessary and sufficient conditions that a subgraph of K*3 can be packed in K*n (Abstract)
- Chapter 52. The enumeration of nonhomeomorphic graphs by edges
- Chapter 53. Optimum restricted base of a matroid
- Chapter 54. A characterization of non-Hamiltonian graphs with large degrees (Abstract)
- Chapter 55. Un problĂšme d' extremum dans les espaces vectoriels binaires
- Chapter 56. On minimal non-Hamiltonian locally Hamil-tonian graphs (Abstract)
- Chapter 57. On a family of selfcomplementary graphs
- Chapter 58. Formes bilieaires symetriques sur un espace vectoriel de dimension finie sur le corps à deux éléments, applications aux matroides biaires
- Chapter 59. On the maximum value of a quadratic form over binary sequences
- Chapter 60. Algorithms for determining the genus of a graph and related problems (Abstract)
- Chapter 61. On the n-clique chromatic number of complementary graphsâ€
- Chapter 62. On cutting planes
- Problem session