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