Combinatorics 79, Part 2

Front Cover
Elsevier, Aug 26, 2011 - Mathematics - 308 pages
0 Reviews
Combinatorics 79. Part II
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Chapter 1 Centers of 2trees
ix
Chapter 2 The edge reconstructibility of planar bidegree graphs
7
Chapter 3 The Hungarian magic cube puzzle
13
Chapter 4 Complete lists of cubic graphs Abstract
21
Chapter 5 Graphes cubiques dindice chromatique quatre
23
Chapter 6 Un problemè de coloration aux aspects varies
29
Chapter 7 Mesures de centralité dun graphe Abstract
35
Chapter 8 Generalized Ramsey numbers involving subdivision graphs and relative problems in graph theory ...
37
Chapter 32 On correlations of finite Boolean lattices Abstract
175
Chapter 33 Properties of 0 1matrices with forbidden configurations
177
Chapter 34 On adjacency matrices for hypergraphs Abstract
181
Chapter 36 Une généralisation dun théorème de GoethalsVan Tilborg
183
an introduction
189
Chapter 38 The pathnumbers of some multipartite graphs
195
Chapter 39 A construction method for minimally kedgeconnected graphs
199
Chapter 40 The automorphism group of a matroid
205

Chapter 9 A general intersection theorem for finite sets
43
Chapter 10 A new paradigm for duality questions Abstract
51
Chapter 11 The complexity of a planar hypermap and that of its dual
53
Chapter 12 Acceptable orientations of graphs
63
Chapter 13 An algebraic upper bound on the independence number of a graph Abstract
65
Chapter 14 Preuve algebriqué du critère de planarite du WuLin
67
Chapter 15 Rediscovery and alternate proof of Gausss identity
79
Chapter 16 Décomposition dun graphe en cycle et chaines
83
Chapter 17 Théorie de la médiane dans les treillis distributifs finis et applications
87
Chapter 18 Graphes noyauparfaits
93
Chapter 19 Threshold numbers and threshold completions
103
Chapter 20 Quasimonotone Boolean functions and bistellar graphs
107
Chapter 21 Minimal triangulations of polygonal domains
121
Chapter 22 Graphs groups and mandalas Abstract
125
Chapter 24 Combinatorial decomposition and graphs realizability Abstract
126
Chapter 25 Multipliers of sets in finite fields and Zn
127
Chapter 26 Analogues for Sperner and ErdösKoRado theorems for subspaces of linear spaces abstract
135
Chapter 27 Generalized principle of inclusion and exclusion and its applications
137
Chapter 28 Les Gsystèmes triples
141
Chapter 29 Comment construire un graphe Pert minimal
147
Chapter 30 Decomposing complete graphs into cycles of length 2pe
155
Chapter 31 Une généralisation dans les pgroupes abéliens élémentaires p2 des théorèmes de HB Mann et JF Dillon sur les ensembles à differences des ...
163
Chapter 41 Combinatorial aspects of continued fractions
217
Chapter 42 The asymptotic behavior of a class of counting functions Abstract
223
Chapter 43 The theorem of Whitney and the four colours conjecture Abstract
224
Chapter 44 Non Hamiltonian cubic planar graphs having just two types of faces
225
Chapter 45 Conjucturally stable coalition structures
229
Chapter 46 Unit distance graphes in rational nspace Abstract
235
Chapter 48 Characterizing hypercubes
237
Chapter 49 Sur les orientations acycliques des géométries orientees de rang trois
243
Chapter 50 Applications of the GordonStiemke theorem in combinatorial matrix theory Abstract
247
Chapter 52 The enumeration of nonhomeomorphic graphs by edges
249
Chapter 53 Optimum restricted base of a matroid
253
Chapter 54 A characterization of nonHamiltonian graphs with large degrees Abstract
259
Chapter 55 Un problème d extremum dans les espaces vectoriels binaires
261
Chapter 56 On minimal nonHamiltonian locally Hamiltonian graphs Abstract
265
Chapter 57 On a family of selfcomplementary graphs
267
Chapter 58 Formes bilieaires symetriques sur un espace vectoriel de dimension finie sur le corps à deux éléments applications aux matroides biaires
269
Chapter 59 On the maximum value of a quadratic form over binary sequences
277
Chapter 60 Algorithms for determining the genus of a graph and related problems Abstract ...
283
Chapter 61 On the nclique chromatic number of complementary graphs
285
Chapter 62 On cutting planes
291
Problem session
297
Copyright

Common terms and phrases

Bibliographic information