European Journal of Combinatorics, Volume 30

Volume 30, Number 1, January 2009

• Jin-ichi Itoh, Liping Yuan:
  Acute triangulations of flat tori. 1-4
  
• Sandi Klavzar, Matjaz Kovse:
  On semicube graphs. 5-10
  
• Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
  The descent statistic on involutions is not log-concave. 11-16
  
• Gábor Kun, Benoit Larose:
  Maximum stable sets in analogs of Kneser and complete graphs. 17-29
  
• Mitsugu Hirasaka:
  On imprimitive multiplicity-free permutation groups the degree of which is the product of two distinct primes. 30-38
  
• Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel:
  Perfect matchings in r-partite r-graphs. 39-42
  
• Jean-François Culus, Bertrand Jouve:
  Convex circuit-free coloration of an oriented graph. 43-52
  
• Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera:
  Projective, affine, and abelian colorings of cubic graphs. 53-69
  
• Martin Henk, Makoto Tagami:
  Lower bounds on the coefficients of Ehrhart polynomials. 70-83
  
• Yaokun Wu:
  Lit-only sigma game on a line graph. 84-95
  
• Joohyung Kim:
  Some matrices associated with the split decomposition for a Q-polynomial distance-regular graph. 96-113
  
• Yusheng Li, Ko-Wei Lih:
  Multi-color Ramsey numbers of even cycles. 114-118
  
• A. M. d'Azevedo Breda, Patrícia S. Ribeiro, Altino F. Santos:
  A class of spherical dihedral f-tilings. 119-132
  
• Thomas Zaslavsky:
  Totally frustrated states in the chromatic theory of gain graphs. 133-156
  
• Cédric Lecouvey:
  Parabolic Kazhdan-Lusztig polynomials, plethysm and generalized Hall-Littlewood functions for classical types. 157-191
  
• Stefko Miklavic:
  Q-polynomial distance-regular graphs with a₁=0 and a₂!=0. 192-207
  
• Gábor Czédli:
  The number of rectangular islands by means of distributive lattices. 208-215
  
• Zsolt Lengvárszky:
  The minimum cardinality of maximal systems of rectangular islands. 216-219
  
• Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
  An upper bound for the minimum weight of the dual codes of desarguesian planes. 220-229
  
• Adam M. Goyt, Bruce E. Sagan:
  Set partition statistics and q-Fibonacci numbers. 230-245
  
• Chris D. Godsil, Aidan Roy:
  Equiangular lines, mutually unbiased bases, and spin models. 246-262
  
• Beifang Chen, Jue Wang:
  The flow and tension spaces and lattices of signed graphs. 263-279
  
• D. Gonçalves:
  A planar linear hypergraph whose edges cannot be represented as straight line segments. 280-282
  
• Marius Tarnauceanu:
  The number of fuzzy subgroups of finite cyclic groups and Delannoy numbers. 283-287
  
• Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
  The fundamental group of the clique graph. 288-294
  
• Sylvie Corteel, Philippe Nadeau:
  Bijections for permutation tableaux. 295-310
  
• Richard Ehrenborg, Margaret Readdy:
  Exponential Dowling structures. 311-326
  
• Primoz Potocnik, Mateja Sajna:
  Vertex-transitive self-complementary uniform hypergraphs. 327-337
  

Volume 30, Number 2, February 2009

• Sonny Ben-Shimon, Michael Krivelevich:
  Vertex percolation on expander graphs. 339-350
  
• Mickaël Montassier, André Raspaud, Xuding Zhu:
  An upper bound on adaptable choosability of graphs. 351-355
  
• Henning Bruhn, Stefanie Kosuch, Melanie Win Myint:
  Bicycles and left-right tours in locally finite graphs. 356-371
  
• Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
  On expansive graphs. 372-379
  
• James G. Lefevre, D. M. Donovan, Mike J. Grannell, Terry S. Griggs:
  A constraint on the biembedding of Latin squares. 380-386
  
• Christian Huck:
  A note on affinely regular polygons. 387-395
  
• Zehui Shao, Xiaodong Xu, Xiaolong Shi, Linqiang Pan:
  Some three-color Ramsey numbers, R(P₄, P₅, C_k) and R(P₄, P₆, C_k). 396-403
  
• Chris Godsil, Karen Meagher:
  A new proof of the Erdös-Ko-Rado theorem for intersecting families of permutations. 404-414
  
• Jason Bandlow, Michele D'Adderio:
  A new proof of a theorem of Littlewood. 415-424
  
• Samuel Fiorini, Gwenaël Joret:
  On a theorem of Sewell and Trotter. 425-428
  
• Alexander Engström:
  Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory. 429-438
  
• Pingzhi Yuan:
  Subsequence sums of a zero-sumfree sequence. 439-446
  
• Brian Curtin, Ibtisam Daqqa:
  The subconstituent algebra of a Latin square. 447-457
  
• Patrick Solé, Dmitrii Zinoviev:
  Inversive pseudorandom numbers over Galois rings. 458-467
  
• Rieuwert J. Blok, Ilaria Cardinali, Bart De Bruyn:
  On the nucleus of the Grassmann embedding of the symplectic dual polar space I, I. 468-472
  
• Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni:
  On theta-episturmian words. 473-479
  
• P. Horak:
  Tilings in Lee metric. 480-489
  
• Anton Dochtermann:
  Hom complexes and homotopy theory in the category of graphs. 490-509
  
• Amy Glen, Jacques Justin, Steve Widmer, Luca Q. Zamboni:
  Palindromic richness. 510-531
  
• Michael Z. Spivey:
  Staircase rook polynomials and Cayley's game of Mousetrap. 532-539
  
• Robert Cori:
  Hypermaps and indecomposable permutations. 540-541
  
• Sinisa T. Vrecica, Rade T. Zivaljevic:
  Cycle-free chessboard complexes and symmetric homology of algebras. 542-554
  
• Steven J. Tedford:
  A Tutte polynomial which distinguishes rooted unicyclic graphs. 555-569
  
• Yusuke Higuchi, Yuji Nomura:
  Spectral structure of the Laplacian on a covering graph. 570-585
  
• Dmitri I. Panyushev:
  On orbits of antichains of positive roots. 586-594
  
• Hong-Jian Lai, Lianying Miao, Yehong Shao:
  Every line graph of a 4-edge-connected graph is I-connected. 595-601
  
• István Kovács, Aleksander Malnic, Dragan Marusic, Stefko Miklavic:
  One-matching bi-Cayley graphs over abelian groups. 602-616
  
• Rudi Hirschfeld:
  On a generalization of the van der Waerden Theorem. 617-621