Volume 29,
August 2007
European Conference on Combinatorics,
Graph Theory and Applications,
European Conference on Combinatorics,
Graph Theory and Applications,
Sevilla,
Spain,
11-15 September 2007
- Alberto Márquez, Jarik Nesetril, Oriol Serra:
Preface.
1-2
Electronic Edition (link) BibTeX
- Jirí Matousek, Ales Prívetivý:
Large Monochromatic Components in Two-colored Grids.
3-9
Electronic Edition (link) BibTeX
- Wolfgang Haas, Jörn Quistorff:
On mixed codes with covering radius 1 and minimum distance 2: (extended abstract).
11-15
Electronic Edition (link) BibTeX
- Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni:
Characterization of affine Steiner triple systems and Hall triple systems.
17-21
Electronic Edition (link) BibTeX
- Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni:
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
23-27
Electronic Edition (link) BibTeX
- Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus:
Ramsey numbers of sparse hypergraphs.
29-33
Electronic Edition (link) BibTeX
- Deryk Osthus, Daniela Kühn:
A minimum degree condition forcing a digraph to be k-linked.
35-39
Electronic Edition (link) BibTeX
- Po-Shen Loh, Benny Sudakov:
Constrained Ramsey Numbers.
41-45
Electronic Edition (link) BibTeX
- Yoshiyasu Ishigami:
Linear Ramsey Numbers for Bounded-Degree Hypergrahps.
47-51
Electronic Edition (link) BibTeX
- Jacob Fox, Benny Sudakov:
Induced Ramsey-type theorems.
53-58
Electronic Edition (link) BibTeX
- Joseph P. S. Kung, Anna de Mier, Xinyu Sun, Catherine Yan:
Lattice paths with periodic boundaries.
59-63
Electronic Edition (link) BibTeX
- Boris Bukh:
Measurable sets with excluded distances.
65-71
Electronic Edition (link) BibTeX
- Yannick Frein, Benjamin Lévêque, András Sebö:
Optimizing diversity.
73-77
Electronic Edition (link) BibTeX
- Francisco Javier Zaragoza Martínez:
Feasibility of the Mixed Postman Problem with Restrictions on the Edges.
79-83
Electronic Edition (link) BibTeX
- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Even Crossings on Surfaces.
85-90
Electronic Edition (link) BibTeX
- Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Approximation of 3-Edge-Coloring of Cubic Graphs.
91-95
Electronic Edition (link) BibTeX
- D. A. Shabanov:
On Some Extremal Properties of Hypergraph Colorings.
97-100
Electronic Edition (link) BibTeX
- Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Folding and Spiralling: The Word View.
101-105
Electronic Edition (link) BibTeX
- Jirí Matousek, Petr Skovron:
Removing degeneracy may require unbounded dimension increase.
107-113
Electronic Edition (link) BibTeX
- Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos:
Graph coloring with no large monochromatic components.
115-122
Electronic Edition (link) BibTeX
- Mehdi Alaeiyan, Mohsen Ghasemi:
Normal Cayley digraphs on minimal non-abelian groups.
123-127
Electronic Edition (link) BibTeX
- Louis Esperet, Pascal Ochem:
On circle graphs with girth at least five.
129-133
Electronic Edition (link) BibTeX
- David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra:
The Connectivity of addition Cayley graphs.
135-139
Electronic Edition (link) BibTeX
- Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
The order of the largest complete minor in a random graph.
141-146
Electronic Edition (link) BibTeX
- Danilo Artigas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Convex Partitions of Graphs.
147-151
Electronic Edition (link) BibTeX
- A. M. Raigorodskii:
On Ramsey Type Problems in Combinatorial Geometry.
153-157
Electronic Edition (link) BibTeX
- L. L. Ivanov:
On the Chromatic Numbers of I and I with Intervals of Forbidden Distances.
159-162
Electronic Edition (link) BibTeX
- Jens Kuhpfahl, Annegret Katrin Wagler, Christian Wagner:
Circular-imperfection of triangle-free graphs.
163-167
Electronic Edition (link) BibTeX
- Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich:
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.
169-173
Electronic Edition (link) BibTeX
- V. A. Koshelev:
On the Erdös-Szekeres problem in combinatorial geometry.
175-177
Electronic Edition (link) BibTeX
- E. Abajo, Ana Diánez:
Size of Graphs with High Girth.
179-183
Electronic Edition (link) BibTeX
- Simeon Ball:
Functions over finite fields that determine few directions.
185-188
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Jesús García, David Orden, Pedro Ramos:
New results on lower bounds for the number of (k)-facets: (extended abstract).
189-193
Electronic Edition (link) BibTeX
- Pascal Ochem, Alexandre Pinlou:
Oriented vertex and arc colorings of partial 2-trees.
195-199
Electronic Edition (link) BibTeX
- P. V. Skums, R. I. Tyshkevich:
Bipartite operator decomposition of graphs and the reconstruction conjecture.
201-205
Electronic Edition (link) BibTeX
- Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs.
207-211
Electronic Edition (link) BibTeX
- Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in positional games.
213-217
Electronic Edition (link) BibTeX
- Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar:
The crossing number of a projective graph is quadratic in the face-width.
219-223
Electronic Edition (link) BibTeX
- Marie Albenque:
Bijective combinatorics of positive braids.
225-229
Electronic Edition (link) BibTeX
- F. Aguiló-Gost:
Sets of Gaps in Sequences of Frobenius' Problems with 3 Elements.
231-236
Electronic Edition (link) BibTeX
- Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees.
237-241
Electronic Edition (link) BibTeX
- Sònia P. Mansilla:
An infinite family of sharply two-arc transitive digraphs.
243-247
Electronic Edition (link) BibTeX
- Diana Piguet, Maya Stein:
An approximate version of the Loebl-Komlós-Sós conjecture.
249-253
Electronic Edition (link) BibTeX
- Volker Strehl:
Fibonacci polynomials: compositions and cyclic products.
255-259
Electronic Edition (link) BibTeX
- Marc Comas, Maria J. Serna:
Vertex fusion under diameter constraints.
261-265
Electronic Edition (link) BibTeX
- Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol, Margarida Mitjana:
A Spectral Study of the Manhattan Networks.
267-271
Electronic Edition (link) BibTeX
- Vít Jelínek, Martin Klazar:
Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).
273-276
Electronic Edition (link) BibTeX
- Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided complete graphs in the hypercube.
277-281
Electronic Edition (link) BibTeX
- Éric Fusy, Dominique Poulalhon, Gilles Schaeffer:
Bijective counting of plane bipolar orientations.
283-287
Electronic Edition (link) BibTeX
- Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
On components of 2-factors in claw-free graphs.
289-293
Electronic Edition (link) BibTeX
- Jan Kyncl:
Enumeration of simple complete topological graphs.
295-299
Electronic Edition (link) BibTeX
- Wolfgang Haas:
On the general excess bound for binary codes with covering radius one.
301-305
Electronic Edition (link) BibTeX
- Jirí Matousek, Robert Sámal:
Induced trees in triangle-free graphs.
307-313
Electronic Edition (link) BibTeX
- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
On the Cubicity of Interval Graphs.
315-319
Electronic Edition (link) BibTeX
- Guy Wolfovitz:
Bounds on the Number of Maximal Sum-Free Sets.
321-325
Electronic Edition (link) BibTeX
- Andrew D. King, Bruce A. Reed:
Asymptotics of the chromatic number for quasi-line graphs.
327-331
Electronic Edition (link) BibTeX
- Miguel Angel Fiol, Ernest Garriga:
Spectral and Geometric Properties of k-Walk-Regular Graphs.
333-337
Electronic Edition (link) BibTeX
- M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, David R. Wood:
Extremal Graph Theory for Metric Dimension and Diameter.
339-343
Electronic Edition (link) BibTeX
- Jirí Fink:
Matching graphs of Hypercubes and Complete Bipartite Graphs.
345-351
Electronic Edition (link) BibTeX
- Iztok Peterin:
Game chromatic number of Cartesian product graphs.
353-357
Electronic Edition (link) BibTeX
- Benjamin Doerr:
Partial Colorings of Unimodular Hypergraphs.
359-363
Electronic Edition (link) BibTeX
- Emeric Gioan, Michel Las Vergnas:
Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids.
365-371
Electronic Edition (link) BibTeX
- Gábor Kun, Jaroslav Nesetril:
NP for Combinatorialists.
373-381
Electronic Edition (link) BibTeX
- Cristina Dalfó, Francesc Comellas, Miguel Angel Fiol:
The Multidimensional Manhattan Network.
383-387
Electronic Edition (link) BibTeX
- Jan Foniok, Jaroslav Nesetril, Claude Tardif:
On Finite Maximal Antichains in the Homomorphism Order.
389-396
Electronic Edition (link) BibTeX
- F. Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster:
Approximation algorithms and hardness results for the clique packing problem.
397-401
Electronic Edition (link) BibTeX
- Attila Sali, László A. Székely:
SPT(q, k, n)-Codes.
403-409
Electronic Edition (link) BibTeX
- Ross J. Kang, Colin J. H. McDiarmid:
The t-improper chromatic number of random graphs.
411-417
Electronic Edition (link) BibTeX
- Louigi Addario-Berry, Ross J. Kang:
Acyclic dominating partitions.
419-425
Electronic Edition (link) BibTeX
- Jirí Matousek, Ales Prívetivý, Petr Skovron:
How many points can be reconstructed from k projections?
427-434
Electronic Edition (link) BibTeX
- Rajneesh Hegde, Kamal Jain:
The Hardness of Approximating Poset Dimension.
435-443
Electronic Edition (link) BibTeX
- Minh Tang:
Generating Functions and the Solutions of Full History Recurrence Equations.
445-449
Electronic Edition (link) BibTeX
- Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs.
451-455
Electronic Edition (link) BibTeX
- Jakub Cerný:
Coloring circle graphs.
457-461
Electronic Edition (link) BibTeX
- Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.
463-469
Electronic Edition (link) BibTeX
- Tomás Dvorák, Petr Gregor:
Hamiltonian fault-tolerance of hypercubes.
471-477
Electronic Edition (link) BibTeX
- Javier Barajas, Oriol Serra:
Regular chromatic number and the lonely runner problem.
479-483
Electronic Edition (link) BibTeX
- Julia Böttcher, Mathias Schacht, Anusch Taraz:
Embedding spanning subgraphs of small bandwidth.
485-489
Electronic Edition (link) BibTeX
- Gábor Wiener:
Edge Multiplicity and Other Trace Functions.
491-495
Electronic Edition (link) BibTeX
- Claudia Käppeli, Dominik Scheder:
Partial Satisfaction of k-Satisfiable Formulas.
497-501
Electronic Edition (link) BibTeX
- R. M. Falcón:
Study of Critical Sets in Latin Squares by using the Autotopism Group.
503-507
Electronic Edition (link) BibTeX
- Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees.
509-513
Electronic Edition (link) BibTeX
- Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed:
List Colouring Squares of Planar Graphs.
515-519
Electronic Edition (link) BibTeX
- Omer Giménez, Marc Noy, Juan José Rué:
Graph classes with given 3-connected components: asymptotic counting and critical phenomena.
521-529
Electronic Edition (link) BibTeX
- Alfredo García, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr:
On embedding triconnected cubic graphs on point sets.
531-538
Electronic Edition (link) BibTeX
- D. Garijo, Jaroslav Nesetril, M. P. Revuelta:
Homomorphisms and Polynomial Invariants of Graphs.
539-545
Electronic Edition (link) BibTeX
- Nils Hebbinghaus:
Discrepancy of Sums of two Arithmetic Progressions.
547-551
Electronic Edition (link) BibTeX
- Hanno Lefmann:
Generalizations of Heilbronn's Triangle Problem.
553-557
Electronic Edition (link) BibTeX
- M. Cámara, Anna S. Lladó, Jordi Moragas:
On a Häggkvist's Conjecture with the Polynomial Method.
559-563
Electronic Edition (link) BibTeX
- Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk:
Two New Classes of Hamiltonian Graphs: (Extended Abstract).
565-569
Electronic Edition (link) BibTeX
- Joe Sawada, Dennis Chi-Him Wong:
A fast algorithm to generate Beckett-Gray codes: Extended Abstract.
571-577
Electronic Edition (link) BibTeX
- Jaroslav Nesetril, Yared Nigussie:
Finite duality for some minor closed classes.
579-585
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:58:09 2009
by Michael Ley (ley@uni-trier.de)
