Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb'07, Seville, Spain, September 11--15, 2007 (Q925312)

The articles of this volume will be announced individually. The preceding conference (3, 2005) has been reviewed (see Zbl 1124.05300, Zbl 1132.05302). Indexed articles: \textit{Matoušek, Jiří; Přívětivý, Aleš}, Large monochromatic components in two-colored grids, 3-9 [Zbl 1341.05082] \textit{Haas, W.; Quistorff, J.}, On mixed codes with covering radius 1 and minimum distance 2. (Extended abstract), 11-15 [Zbl 1341.05019] \textit{Král', Daniel; Máčajová, Edita; Pór, Attila; Sereni, Jean-Sébastien}, Characterization of affine Steiner triple systems and Hall triple systems, 17-21 [Zbl 1341.05014] \textit{Král', Daniel; Máčajová, Edita; Pór, Attila; Sereni, Jean-Sébastien}, Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems, 23-27 [Zbl 1341.05015] \textit{Kühn, Daniela; Cooley, Oliver; Fountoulakis, Nikolaos; Osthus, Deryk}, Ramsey numbers of sparse hypergraphs, 29-33 [Zbl 1341.05156] \textit{Osthus, Deryk; Kühn, Daniela}, A minimum degree condition forcing a digraph to be \(k\)-linked, 35-39 [Zbl 1341.05103] \textit{Loh, Po-Shen; Sudakov, Benny}, Constrained Ramsey numbers, 41-45 [Zbl 1341.05157] \textit{Ishigami, Yoshiyasu}, Linear Ramsey numbers for bounded-degree hypergrahps, 47-51 [Zbl 1341.05155] \textit{Fox, Jacob; Sudakov, Benny}, Induced Ramsey-type theorems, 53-58 [Zbl 1341.05154] \textit{Kung, Joseph P. S.; de Mier, Anna; Sun, Xinyu; Yan, Catherine}, Lattice paths with periodic boundaries, 59-63 [Zbl 1341.05134] \textit{Bukh, Boris}, Measurable sets with excluded distances, 65-71 [Zbl 1236.52015] \textit{Frein, Yannick; Lévêque, Benjamin; Sebő, András}, Optimizing diversity, 73-77 [Zbl 1341.05131] \textit{Zaragoza Martínez, Francisco Javier}, Feasibility of the mixed postman problem with restrictions on the edges, 79-83 [Zbl 1341.05242] \textit{Pelsmajer, Michael J.; Schaefer, Marcus; Štefankovič, Daniel}, Removing even crossings on surfaces, 85-90 [Zbl 1341.05175] \textit{Kochol, Martin; Krivoňáková, Nad'a; Smejová, Silvia; Šranková, Katarína}, Approximation of 3-edge-coloring of cubic graphs, 91-95 [Zbl 1341.05079] \textit{Shabanov, D. A.}, On some extremal properties of hypergraph colorings, 97-100 [Zbl 1341.05090] \textit{Schaefer, Marcus; Sedgwick, Eric; Šefankovič, Daniel}, Folding and spiralling: The word view, 101-105 [Zbl 1341.05246] \textit{Matoušek, Jiří; Škovroň, Petr}, Removing degeneracy may require unbounded dimension increase, 107-113 [Zbl 1341.05244] \textit{Linial, Nathan; Matoušek, Jiří; Sheffet, Or; Tardos, Gábor}, Graph coloring with no large monochromatic components, 115-122 [Zbl 1341.05080] \textit{Alaeiyan, Mehdi; Ghasemi, Mohsen}, Normal Cayley digraphs on minimal non-Abelian groups, 123-127 [Zbl 1341.05115] \textit{Esperet, Louis; Ochem, Pascal}, On circle graphs with girth at least five, 129-133 [Zbl 1341.05072] \textit{Grynkiewicz, David; Lev, Vsevolod F.; Serra, Oriol}, The connectivity of addition Cayley graphs, 135-139 [Zbl 1259.05098] \textit{Fountoulakis, N.; Kühn, D.; Osthus, D.}, The order of the largest complete minor in a random graph, 141-146 [Zbl 1341.05228] \textit{Artigas, Danilo; Dourado, Mitre C.; Szwarcfiter, Jayme L.}, Convex partitions of graphs, 147-151 [Zbl 1341.05198] \textit{Raigorodskii, A. M.}, On Ramsey type problems in combinatorial geometry, 153-157 [Zbl 1341.05247] \textit{Ivanov, L. L.}, On the chromatic numbers of \(\mathbb R^2\) and \(\mathbb R^3\) with intervals of forbidden distances, 159-162 [Zbl 1341.05052] \textit{Kuhpfahl, Jens; Wagler, Annegret K.; Wagner, Christian}, Circular-imperfection of triangle-free graphs, 163-167 [Zbl 1341.05093] \textit{Orlovich, Yury L.; Gordon, Valery S.; Potts, Chris N.; Strusevich, Vitaly A.}, On Hamilton cycles in locally connected graphs with vertex degree constraints, 169-173 [Zbl 1341.05143] \textit{Koshelev, V. A.}, On the Erdős-Szekeres problem in combinatorial geometry, 175-177 [Zbl 1341.51006] \textit{Abajo, E.; Diánez, A.}, Size of graphs with high girth, 179-183 [Zbl 1341.05047] \textit{Ball, Simeon}, Functions over finite fields that determine few directions, 185-188 [Zbl 1341.05003] \textit{Aichholzer, Oswin; García, Jesús; Orden, David; Ramos, Pedro}, New results on lower bounds for the number of (\(\leqslant k\))-facets. (Extended abstract), 189-193 [Zbl 1341.05022] \textit{Ochem, Pascal; Pinlou, Alexandre}, Oriented vertex and arc colorings of partial 2-trees, 195-199 [Zbl 1341.05087] \textit{Skums, P. V.; Tyshkevich, R. I.}, Bipartite operator decomposition of graphs and the reconstruction conjecture, 201-205 [Zbl 1341.05170] \textit{Lévêque, Benjamin; Lin, David Y.; Maffray, Frédéric; Trotignon, Nicolas}, Detecting induced subgraphs, 207-211 [Zbl 1341.05169] \textit{Hefetz, Dan; Krivelevich, Michael; Stojaković, Miloš; Szabó, Tibor}, Fast winning strategies in positional games, 213-217 [Zbl 1341.05159] \textit{Gitler, Isidoro; Hliněný, Petr; Leaños, Jesus; Salazar, Gelasio}, The crossing number of a projective graph is quadratic in the face-width, 219-223 [Zbl 1341.05040] \textit{Albenque, Marie}, Bijective combinatorics of positive braids, 225-229 [Zbl 1228.05058] \textit{Aguiló-Gost, Francesc}, Sets of gaps in sequences of Frobenius' problems with 3 elements, 231-236 [Zbl 1341.05096] \textit{Brešar, Boštjan; Klavžar, Sandi; Rall, Douglas F.}, On the packing chromatic number of Cartesian products, hexagonal lattice, and trees, 237-241 [Zbl 1341.05064] \textit{Mansilla, Sònia P.}, An infinite family of sharply two-arc transitive digraphs, 243-247 [Zbl 1341.05102] \textit{Piguet, Diana; Stein, Maya}, An approximate version of the Loebl-Komlós-Sós conjecture, 249-253 [Zbl 1341.05033] \textit{Strehl, Volker}, Fibonacci polynomials: compositions and cyclic products, 255-259 [Zbl 1341.05130] \textit{Comas, Marc; Serna, Maria}, Vertex fusion under diameter constraints, 261-265 [Zbl 1341.05048] \textit{Comellas, F.; Dalfó, C.; Fiol, M. A.; Mitjana, M.}, A spectral study of the Manhattan networks, 267-271 [Zbl 1341.05151] \textit{Jelínek, Vít; Klazar, Martin}, Generalizations of Khovanskiĭ's theorem on growth of sumsets in abelian semigroups. (Extended abstract), 273-276 [Zbl 1341.05004] \textit{Beaudou, Laurent; Gravier, Sylvain; Meslem, Kahina}, Isometric embeddings of subdivided complete graphs in the hypercube, 277-281 [Zbl 1341.05163] \textit{Fusy, Éric; Poulalhon, Dominique; Schaeffer, Gilles}, Bijective counting of plane bipolar orientations, 283-287 [Zbl 1341.05039] \textit{Broersma, Hajo; Paulusma, Daniel; Yoshimoto, Kiyoshi}, On components of 2-factors in claw-free graphs, 289-293 [Zbl 1341.05030] \textit{Kynčl, Jan}, Enumeration of simple complete topological graphs, 295-299 [Zbl 1341.05126] \textit{Haas, Wolfgang}, On the general excess bound for binary codes with covering radius one, 301-305 [Zbl 1341.94032] \textit{Matoušek, Jiří; Šámal, Robert}, Induced trees in triangle-free graphs, 307-313 [Zbl 1341.05026] \textit{Chandran, L. Sunil; Francis, Mathew C.; Sivadasan, Naveen}, On the cubicity of interval graphs, 315-319 [Zbl 1341.05221] \textit{Wolfovitz, Guy}, Bounds on the number of maximal sum-free sets, 321-325 [Zbl 1341.05010] \textit{King, Andrew D.; Reed, Bruce}, Asymptotics of the chromatic number for quasi-line graphs, 327-331 [Zbl 1341.05078] \textit{Fiol, M. A.; Garriga, E.}, Spectral and geometric properties of \(k\)-walk-regular graphs, 333-337 [Zbl 1341.05136] \textit{Hernando, C.; Mora, M.; Pelayo, I. M.; Seara, C.; Wood, D. R.}, Extremal graph theory for metric dimension and diameter, 339-343 [Zbl 1341.05132] \textit{Fink, Jiří}, Matching graphs of hypercubes and complete bipartite graphs, 345-351 [Zbl 1341.05206] \textit{Peterin, Iztok}, Game chromatic number of Cartesian product graphs, 353-357 [Zbl 1341.05088] \textit{Doerr, Benjamin}, Partial colorings of unimodular hypergraphs, 359-363 [Zbl 1341.05070] \textit{Gioan, Emeric; Vergnas, Michel Las}, Fully optimal bases and the active bijection in graphs, hyperplane arrangements, and oriented matroids, 365-371 [Zbl 1341.05023] \textit{Kun, Gábor; Nešetřil, Jaroslav}, NP for combinatorialists, 373-381 [Zbl 1341.05100] \textit{Dalfó, C.; Comellas, F.; Fiol, M. A.}, The multidimensional Manhattan network, 383-387 [Zbl 1341.05099] \textit{Foniok, Jan; Nešetřil, Jaroslav; Tardif, Claude}, On finite maximal antichains in the homomorphism order, 389-396 [Zbl 1341.05167] \textit{Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R.}, Approximation algorithms and hardness results for the clique packing problem, 397-401 [Zbl 1341.05204] \textit{Sali, Attila; Székely, László}, SPT\((q,k,n)\)-codes, 403-409 [Zbl 1341.94029] \textit{Kang, Ross J.; McDiarmid, Colin J. H.}, The \(t\)-improper chromatic number of random graphs, 411-417 [Zbl 1341.05077] \textit{Addario-Berry, Louigi; Kang, Ross J.}, Acyclic dominating partitions, 419-425 [Zbl 1341.05058] \textit{Matoušek, Jiří; Přívětivý, Aleš; Škovroň, Petr}, How many points can be reconstructed from \(k\) projections?, 427-434 [Zbl 1341.05245] \textit{Hegde, Rajneesh; Jain, Kamal}, The hardness of approximating poset dimension., 435-443 [Zbl 1341.06002] \textit{Tang, Minh}, Generating functions and the solutions of full history recurrence equations, 445-449 [Zbl 1341.05009] \textit{Pêcher, Arnaud; Zhu, Xuding}, Claw-free circular-perfect graphs, 451-455 [Zbl 1341.05094] \textit{Černý, Jakub}, Coloring circle graphs, 457-461 [Zbl 1341.05057] \textit{Bonsma, Paul; Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew}, Finding paths between graph colourings: Computational complexity and possible distances, 463-469 [Zbl 1341.05063] \textit{Dvořák, Tomáš; Gregor, Petr}, Hamiltonian fault-tolerance of hypercubes, 471-477 [Zbl 1341.05142] \textit{Barajas, J.; Serra, O.}, Regular chromatic number and the lonely runner problem, 479-483 [Zbl 1215.05052] \textit{Böttcher, Julia; Schacht, Mathias; Taraz, Anusch}, Embedding spanning subgraphs of small bandwidth, 485-489 [Zbl 1341.05165] \textit{Wiener, Gábor}, Edge multiplicity and other trace functions, 491-495 [Zbl 1341.05182] \textit{Käppeli, Claudia; Scheder, Dominik}, Partial satisfaction of \(k\)-satisfiable formulas, 497-501 [Zbl 1341.68063] \textit{Falcón, R. M.}, Study of critical sets in Latin squares by using the autotopism group, 503-507 [Zbl 1341.05018] \textit{Cooper, Joshua; Doerr, Benjamin; Friedrich, Tobias; Spencer, Joel}, Deterministic random walks on regular trees, 509-513 [Zbl 1341.05233] \textit{Havet, Frédéric; van den Heuvel, Jan; McDiarmid, Colin; Reed, Bruce}, List colouring squares of planar graphs, 515-519 [Zbl 1341.05073] \textit{Giménez, Omer; Noy, Marc; Rué, Juan José}, Graph classes with given 3-connected components: Asymptotic counting and critical phenomena, 521-529 [Zbl 1341.05138] \textit{García, Alfredo; Hurtado, Ferran; Huemer, Clemens; Tejel, Javier; Valtr, Pavel}, On embedding triconnected cubic graphs on point sets, 531-538 [Zbl 1341.05137] \textit{Garijo, D.; Nešetřil, J.; Revuelta, M. P.}, Homomorphisms and polynomial invariants of graphs, 539-545 [Zbl 1341.05128] \textit{Hebbinghaus, Nils}, Discrepancy of sums of two arithmetic progressions, 547-551 [Zbl 1235.11076] \textit{Lefmann, Hanno}, Generalizations of Heilbronn's triangle problem, 553-557 [Zbl 1341.05180] \textit{Cámara, M.; Lladó, A.; Moragas, J.}, On a Häggkvist's conjecture with the polynomial method, 559-563 [Zbl 1341.05202] \textit{Arkin, Esther M.; Mitchell, Joseph S. B.; Polishchuk, Valentin}, Two new classes of Hamiltonian graphs. (Extended abstract), 565-569 [Zbl 1341.05140] \textit{Sawada, Joe; Wong, Dennis Chi-Him}, A fast algorithm to generate Beckett-Gray codes. (Extended abstract), 571-577 [Zbl 1341.94028] \textit{Nešetřil, Jaroslav; Nigussie, Yared}, Finite duality for some minor closed classes, 579-585 [Zbl 1341.05235]