Combinatorics 79, Part 1

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

What people are saying - Write a review

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

Contents

Chapter 1 Les facteurs des graphes
1
Chapter 2 On the Tutte polynomial of a morphism of matroids
7
Chapter 3 On the independent set numbers of a finite matroid
21
Chapter 4 Unions of oriented matroids
29
Chapter 5 Sommes et produits lexicographiques Abstract
35
Chapter 7 Quelques recents résultats sur certains problémes combinatoires Abstract
36
Chapter 8 Bipartite graphes with a central symmetry and 1 1 matrices
37
Chapter 9 Room squares generalized
43
Chapter 28 Nested designs Abstract
169
Chapter 29 Some designs used in constructing skew Room squares
171
Chapter 30 Infinite classes of cyclic Steiner quadruple systems
177
Chapter 31 Disjoint stable sets in a graph Abstract
183
Chapter 32 Degrees in homogeneously traceable graphs
185
Chapter 33 Sur une application du principe pour minimiser linterdependence dans les Automates probabilistes
189
Chapter 34 A brief account of matroid designs abstract
195
aspects combinatoires
197

Chapter 10 Group divisible difference sets and their multipliers Abstract
59
Chapter 11 Some results on relative difference sets of small size Abstract
60
Chapter 12 Connectivity of transitive digraphs and a combinatorial property of finite groups
61
Chapter 13 Transformation of Euler tours
65
Chapter 14 Sur lexistence de petites composantes dans tout systéme parfait dinsembles de différences
71
Chapter 15 Caractérisation des tournois presquhomogénes
77
Chapter 16 On Tuttes characterization of graphic matroids
83
Chapter 17 Hypergraphes critiques pour le nombre chromatique et conjecture de Lovász
91
Chapter 18 Isomorphism testing and symmetry of graphs
101
Chapter 19 Identification of graphs Abstract
111
Chapter 20 The complexity of combinatorial isomorphism problems
113
Chapter 21 On Hortons law for random channel networks
117
Chapter 22 On graphicminimal spaces
123
Chapter 23 A propos dun problème dalgèbre de Boole
127
Chapter 24 Graphes de nombre facial 3 ou 4
129
Chapter 25 Graphes dintervalle dimmersion 1
137
Chapter 26 Structural rigidity I foundations and rigidity criteria
143
Chapter 27 A result of MacMahon on electoral predictions
163
Chapter 33 Some metrical problems on Sn
211
Chapter 34 Extremal metrics induced by graphs
217
Chapter 35 The concavity and intersection properties for integral polyhedra
221
Chapter 36 Une classe particuliére de matroides parfaits
229
Chapter 37 On edgecoloration of multigraphs Abstract
233
Chapter 38 Primitive decomposition of a graph
235
Chapter 39 Carrés siamois
243
Chapter 40 Covering three edges with a bond in a nonseparable graph Abstract
247
Chapter 41 Recognizing intersection patterns
249
Chapter 42 Relative lengths of paths and cycles in kconnected graphs
253
Chapter 43 On the diagonal hypergraph of a matrix
261
Chapter 44 Combinatorial aspects of finite sampling theory Abstract
265
Chapter 45 Programming problems on ncomplexes
267
Chapter 46 Paths and cycles in oriented graphs
275
Chapter 47 On a digraph dimension
279
Chapter 48 The problem of fixed points in ordered sets
283
Chapter 49 Chemins et circuits dans les graphes orientés
293
Copyright

Common terms and phrases

Bibliographic information