Volume 10, November 2001

Comb01, Euroconference on Combinatorics, Graph Theory and Applications, CRM, Bellaterra, Barcelona, Spain, 12-15 September 2001

• 
  Jaroslav Nesetril, Marc Noy, Oriol Serra: Preface: Volume 10. 1
• 
  Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a 6-contraction critical graph. 2-6
• 
  Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier: On the growth of components with non-fixed excesses. 7-12
• 
  Camino Balbuena: Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence. 13-16
• 
  János Barát: 2-star-coloring of graphs. 17-19
• 
  Rommel Barbosa, Domingos Moreira Cardoso: On regular-stable graphs. 20-22
• 
  Halina Bielak: Local and Mean Ramsey Numbers for Some Graphs. 23-26
• 
  Olivier Bodini: Tiling a Manhattan Polyomino with Bars. 27-29
• 
  Joaquim Borges, Josep Rifà, Victor A. Zinoviev: On completely regular binary codes and t-designs^*. 30-33
• 
  Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca: Treewidth of planar graphs: connections with duality. 34-38
• 
  Luis Boza, Eugenio M. Fedriani, Alberto Márquez, Juan Núñez, P. Revuelta: Infinite graph embeddings on tubular surfaces. 39-41
• 
  Luis Boza, Maria Teresa Davila, Eugenio M. Fedriani, Rafael Moyano: A Kuratowski Theorem for some Pseudosurfaces. 42-46
• 
  Bostjan Bresar, Sandi Klavzar, Riste Skrekovski: Cubes polynomial and its derivatives. 47-49
• 
  J. Burillo, E. Ventura: Counting Primitive Elements in Free Groups. 50-53
• 
  Peter J. Cameron: Random strongly regular graphs? 54-63
• 
  Philippe Cara: Incidence geometries for the finite symmetric groups. 64-67
• 
  Angeles Carmona, Enrique Bendito, Andrés M. Encinas: Equilibrium Measures on Finite Networks: Effective Resistance and Hitting Time. 68-71
• 
  M. Cera, Ana Diánez, Pedro García-Vázquez: Structure of the Extremal Family ex(n;tk^p). 72-74
• 
  M. J. Chávez de Diego, M. T. Villar Liñán: Triangles n-Connectivity in Simplicial 2-Complexes. 75-76
• 
  Vladimir Cepulic: Construction of symmetric block designs using normal subgroups of automorphism groups. 77-79
• 
  Francesc Comellas, Miguel Angel Fiol, Joan Gimbert, Margarida Mitjana: On the Spectrum of a Weakly Distance-Regular Digraph. 80-83
• 
  Francesc Comellas, Javier Ozón: On the Universality of Small-World Graphs. 84-87
• 
  Dean Crnkovic, Sanja Rukavina: Hadamard 2-(47, 23, 11) Designs havingFrob₅₅ as an Automorphism Group. 88-89
• 
  Benjamin Doerr: Vector Balancing Games with Aging. 90-92
• 
  Hazel Everett, Celina M. Herrera de Figueiredo, Sulamita Klein, Bruce A. Reed: Bull-Reducible Berge Graphs are Perfect. 93-95
• 
  Sándor P. Fekete, Robert T. Firla, Bianca Spille: Matching as the Intersection of Matroids. 96-99
• 
  Cristina Fernández-Córdoba, Josep Rifà, Joaquim Borges: Every Z_2k-Code is a Binary Propelinear Code. 100-102
• 
  Guillaume Fertin, André Raspaud: Neighborhood Communications in Networks. 103-108
• 
  Peter Frankl, Gyula Y. Katona: Extremal k-edge-hamiltonian Hypergraphs. 109-112
• 
  Giulia Galbiati: On Optimum Cycle Bases. 113-116
• 
  Cyril Gavoille, Christophe Paul: Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. 117-120
• 
  Eduard Kh. Gimadi: On the connectedness property of service areas for the Network Facility Location Problem. 121-124
• 
  Edward Gimadi, Natalie Kairan: Multi-index axial assignment problem on single-cyclic permutations. 125-128
• 
  Erhard Godehardt, Jerzy Jaworski: Two Models of Random Intersection Graphs and their Applications. 129-132
• 
  Pere Guitart: A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs. 133-136
• 
  Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast approximation schemes for K_{3, 3}-minor-free or K₅-minor-free graphs. 137-142
• 
  Sven Hartmann: Orthogonal directed covers by flowers. 143-145
• 
  Glenn Hurlbert: On the Pebbling Threshold Spectrum. 146-150
• 
  Bill Jackson, Tibor Jordán: Non-Separable Detachments of Graphs. 151-153
• 
  Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Extremal problems under dimension constraints. 154-156
• 
  Hamamache Kheddouci: On the packing of trees into their power. 157-159
• 
  János Körner, Angelo Monti: Delta-systems and qualitative (in)dependence. 160-163
• 
  Daniel Krob, Jean Mairesse, Ioannis Michos: On the average Cartier-Foata height of traces. 164-171
• 
  Uwe Leek: On the orthogonal product of simplices and products of truncated Boolean lattices. 172-175
• 
  Martin Loebl, Jaroslav Nesetril, Bruce A. Reed: A note on Random Homomorphism from ArbitraryGraphs to Z. 176-180
• 
  Guy Louchard, Helmut Prodinger: Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. 181-186
• 
  Federico Malucelli, Sara Nicoloso: Optimal partition of a bipartite graph into non-crossing matchings. 187-191
• 
  Ricard Martí, Enric Nart: Isometry classes of codes arising from sets of points in the projective plane. 192-193
• 
  Jirí Matousek: Transversals of hypergraphs with geometric flavor. 194-197
• 
  Colin McDiarmid, Bruce A. Reed: Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. 198-201
• 
  Guy Melançon, I. Dutour, Mireille Bousquet-Mélou: Random Generation of Directed Acyclic Graphs. 202-207
• 
  Xavier Molinero: Iterating Through Labelled Combinatorial Structures. 208-211
• 
  David Orden, Francisco Santos: Assymptotically efficient triangulations of the d-cube^*. 212-215
• 
  Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena: Every Cubic Cage is quasi 4-connected. 216-219
• 
  Kevin T. Phelps: Combinatorial designs and perfect codes. 220-234
• 
  Kevin T. Phelps, Mercè Villanueva: Bounds on the rank and kernel of perfect codes. 235-237
• 
  Julian Pfeifle: Kalai's squeezed 3-spheres are polytopal. 238-241
• 
  Oleg Pikhurko: Size Ramsey Numbers and Integer Programming. 242-244
• 
  Sanja Rukavina: On some new 2-(56, 12, 3) designs. 245-246
• 
  Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the Maximum Size of (p, Q) - free Families. 247-249
• 
  Oda Sans, André Pönitz: Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability. 250-254
• 
  Aditya Shastri: Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT). 255-260
• 
  F. Aguiló, Ester Simó, Marisa Zaragozá: On Dense Triple-Loop Networks. 261-264
• 
  Milos Stojakovic: On Finding The Limit Shape Of Optimal Convex Lattice Polygons. 265-267
• 
  S. Strauss, Lilian Markenzon: A Cryptographic Code Based on Digraphs. 268-271
• 
  Susumu Suzuki, Toshihide Ibaraki: Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products. 272-276
• 
  Jan Arne Telle: Tree-decompositions of small pathwidth. 277-280
• 
  Olivier Togni: Optical Routing of Uniform Instances in Cayley Graphs. 281-285
• 
  Pascal Weil: Graphs, intersections of subgroups of free groups and corank. 286-290
• 
  David R. Wood: Geometric Thickness in a Grid of Linear Area. 291-296
• 
  Wilfried Imrich, Blaz Zniazek, Janez Zerovnik: Weak k-reconstruction of cartesian product graphs. 297-300