Combinatorics 79. Part II
eBook - PDF

Combinatorics 79. Part II

  1. 308 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Combinatorics 79. Part II

About this book

Combinatorics 79. Part II

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
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.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
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 use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
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 Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.

Information

Publisher
North Holland
Year
2011
Print ISBN
9780444861115
eBook ISBN
9780080867724
Topic
Mathematics
Subtopic
Discrete Mathematics
Index
Mathematics

Table of contents

  1. Front Cover
  2. Annals of Discrete Mathematics Combinatorics 79, Part II
  3. Copyright Page 
  4. Contents
  5. Chapter 1. Centers of 2-trees
  6. Chapter 2. The edge reconstructibility of planar bidegree graphs
  7. Chapter 3. The Hungarian magic cube puzzle
  8. Chapter 4. Complete lists of cubic graphs (Abstract)
  9. Chapter 5. Graphes cubiques d'indice chromatique quatre
  10. Chapter 6. Un problemĂš de coloration aux aspects varies
  11. Chapter 7. Mesures de centralité d'un graphe (Abstract)
  12. Chapter 8. Generalized Ramsey numbers involving subdivision graphs, and relative problems in graph theory
  13. Chapter 9. A general intersection theorem for finite sets
  14. Chapter 10. A new paradigm for duality questions (Abstract)
  15. Chapter 11. The complexity of a planar hypermap and that of its dual 
  16. Chapter 12. Acceptable orientations of graphs
  17. Chapter 13. An algebraic upper bound on the independence number of a graph (Abstract)
  18. Chapter 14. Preuve algebriqué du critÚre de planarite du Wu-Lin
  19. Chapter 15. Rediscovery and alternate proof of Gauss's identity
  20. Chapter 16. DĂ©composition d'un graphe en cycle et chaines
  21. Chapter 17. Théorie de la médiane dans les treillis distributifs finis et applications
  22. Chapter 18. Graphes noyau-parfaits
  23. Chapter 19. Threshold numbers and threshold completions
  24. Chapter 20. Quasimonotone Boolean functions and bistellar graphs
  25. Chapter 21. Minimal triangulations of polygonal domains
  26. Chapter 22. Graphs, groups and mandalas (Abstract)
  27. Chapter 23. Packing problems (Abst act)
  28. Chapter 24. Combinatorial decomposition and graphs realizability (Abst act)
  29. Chapter 25. Multipliers of sets in finite fields and Zn
  30. Chapter 26. Analogues for Sperner and Erdös-Ko-Rado theorems for sub-spaces of linear spaces (abstract)
  31. Chapter 27. Generalized principle of inclusion and exclusion and its applications
  32. Chapter 28. Les G-systĂšmes triples
  33. Chapter 29. Comment construire un graphe Pert minimal
  34. Chapter 30. Decomposing complete graphs into cycles of length 2pe
  35. 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
  36. Chapter 32. On correlations of finite Boolean lattices (Abstract)
  37. Chapter 33. Properties of (0, 1)-matrices with forbidden configurations
  38. Chapter 34. On adjacency matrices for hypergraphs (Abstract)
  39. Chapter 35. Prime triangular matrices of integers (Abstract)
  40. Chapter 36. Une généralisation d'un théorÚme de Goethals-Van Tilborg
  41. Chapter 37. The jump number of dags and posets: an introduction
  42. Chapter 38. The path-numbers of some multipartite graphs
  43. Chapter 39. A construction method for minimally k-edge-connected graphs
  44. Chapter 40. The automorphism group of a matroid
  45. Chapter 41. Combinatorial aspects of continued fractions
  46. Chapter 42. The asymptotic behavior of a class of counting functions (Abstract)
  47. Chapter 43. The theorem of Whitney and the four colours conjecture (Abstract)
  48. Chapter 44. Non Hamiltonian cubic planar graphs having just two types of faces
  49. Chapter 45. Conjucturally stable coalition structures
  50. Chapter 46. Unit distance graphes in rational n-space (Abstract)
  51. Chapter 47. Counting three-connected graphs (Abstract)
  52. Chapter 48. Characterizing hypercubes
  53. Chapter 49. Sur les orientations acycliques des géométries orientees de rang trois
  54. Chapter 50. Applications of the Gordon–Stiemke theorem in combinatorial matrix theory (Abstract)
  55. Chapter 51. Necessary and sufficient conditions that a subgraph of K*3 can be packed in K*n (Abstract)
  56. Chapter 52. The enumeration of nonhomeomorphic graphs by edges
  57. Chapter 53. Optimum restricted base of a matroid
  58. Chapter 54. A characterization of non-Hamiltonian graphs with large degrees (Abstract)
  59. Chapter 55. Un problĂšme d' extremum dans les espaces vectoriels binaires
  60. Chapter 56. On minimal non-Hamiltonian locally Hamil-tonian graphs (Abstract)
  61. Chapter 57. On a family of selfcomplementary graphs
  62. Chapter 58. Formes bilieaires symetriques sur un espace vectoriel de dimension finie sur le corps à deux éléments, applications aux matroides biaires
  63. Chapter 59. On the maximum value of a quadratic form over binary sequences
  64. Chapter 60. Algorithms for determining the genus of a graph and related problems (Abstract)
  65. Chapter 61. On the n-clique chromatic number of complementary graphs 
  66. Chapter 62. On cutting planes
  67. Problem session