Electronic Notes in Discrete Mathematics, Volume 29

Volume 29, August 2007

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

Last update Wed Feb 15 04:33:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page