default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean 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, Benoît 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 - Ana 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 a1=0 and a2!=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 - Daniel 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 A. 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, Diane 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(P4, P5, Ck) and R(P4, P6, Ck). 396-403 - Chris D. 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 V. 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
Volume 30, Number 3, April 2009
- Tatsuro Ito, Alexandre A. Ivanov, Akihiro Munemasa:
Preface. 623-624 - Christine Bachoc, Frank Vallentin:
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps. 625-637 - Sejeong Bang, Tatsuya Fujisaki, Jack H. Koolen:
The spectra of the local graphs of the twisted Grassmann graphs. 638-654 - Etsuko Bannai:
New examples of Euclidean tight 4-designs. 655-667 - Andries E. Brouwer, Jack H. Koolen:
The vertex-connectivity of a distance-regular graph. 668-673 - Diana R. Cerzo, Hiroshi Suzuki:
Non-existence of imprimitive Q-polynomial schemes of exceptional type with d=4. 674-681 - Tatsuro Ito, Paul M. Terwilliger:
Distance-regular graphs and the q-tetrahedron algebra. 682-697 - William J. Martin, Jason S. Williford:
There are finitely many Q-polynomial association schemes with given first multiplicity at least three. 698-704 - Mikhail E. Muzychuk:
A wedge product of association schemes. 705-715 - Gabriele Nebe, Boris Venkov:
On lattices whose minimal vectors form a 6-design. 716-724 - Kenichiro Tanabe, Hiromichi Yamada:
Representations of a fixed-point subalgebra of a class of lattice vertex operator algebras by an automorphism of order three. 725-735 - Hajime Tanaka:
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra. 736-746 - Satoshi Yoshiara:
Dimensional dual hyperovals with doubly transitive automorphism groups. 747-757
Volume 30, Number 4, May 2009
- Václav Flaska:
One very particular example of a congruence-simple semiring. 759-763 - William Y. C. Chen, David G. L. Wang, Iris F. Zhang:
Partitions of Zn into arithmetic progressions. 764-773 - John L. Goldwasser, Xinmao Wang, Yaokun Wu:
Does the lit-only restriction make any difference for the sigma-game and sigma+-game? 774-787 - Yotsanan Meemark, Tassawee Thitipak:
An equivalence relation on a set of words of finite length. 788-797 - Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio:
On bipartite graphs of defect 2. 798-808 - Gerard J. Chang:
A note on equitable colorings of forests. 809-812 - Yair Caro, Raphael Yuster:
Large disjoint subgraphs with the same order and size. 813-821 - Klavdija Kutnar, Dragan Marusic, Stefko Miklavic, Primoz Sparl:
Strongly regular tri-Cayley graphs. 822-832 - Shubhangi Saraf:
Acute and nonobtuse triangulations of polyhedral surfaces. 833-840 - Yu. I. Lyubich:
Lower bounds for projective designs, cubature formulas and related isometric embeddings. 841-852 - Mathieu Dutour Sikiric, Viatcheslav P. Grishukhin:
The decomposition of the hypermetric cone into L-domains. 853-865 - Mihai Prunescu:
Self-similar carpets over finite fields. 866-878 - Etienne de Klerk, Michael W. Newman, Dmitrii V. Pasechnik, Renata Sotirov:
On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. 879-888 - Zsolt Lengvárszky:
The size of maximal systems of square islands. 889-892 - Akira Hiraki:
A characterization of some distance-regular graphs by strongly closed subgraphs. 893-907 - Eyal Ackerman, Oren Ben-Zwi:
On sets of points that determine only acute angles. 908-910 - Bart De Bruyn:
The uniqueness of the SDPS-set of the symplectic dual polar space DW(4n-1, q), n>=2. 911-922 - Qizhong Lin, Yusheng Li:
Bipartite Ramsey numbers involving large Kn, n. 923-928 - Kendra Killpatrick:
Some statistics for Fibonacci tableaux. 929-933 - Lionel Nguyen Van Thé:
Ramsey degrees of finite ultrametric spaces, ultrametric Urysohn spaces and dynamics of their isometry groups. 934-945 - Naveen Belkale, L. Sunil Chandran:
Hadwiger's conjecture for proper circular arc graphs. 946-956 - Dragan Stevanovic, Marko Milosevic:
A spectral proof of the uniqueness of a strongly regular graph with parameters (81, 20, 1, 6). 957-968 - Nancy S. S. Gu, Helmut Prodinger:
Bijections for 2-plane trees and ternary trees. 969-985 - Suresh Manjanath Hegde:
Set colorings of graphs. 986-995 - Stephan G. Wagner, Hua Wang:
On the parity of the Wiener index. 996-1004 - Dan Drake:
The combinatorics of associated Hermite polynomials. 1005-1021 - Iiro S. Honkala:
On r-locating-dominating sets in paths. 1022-1025 - Lionel Levine:
The sandpile group of a tree. 1026-1035
- Petr Hlinený, Geoff Whittle:
Addendum to matroid tree-width. 1036-1044
Volume 30, Number 5, July 2009
- Sandi Klavzar, Sergey V. Shpectorov:
Preface. 1045-1047 - Kannan Balakrishnan, Manoj Changat, Iztok Peterin, Simon Spacapan, Primoz Sparl, Ajitha R. Subhamathi:
Strongly distance-balanced graphs and graph products. 1048-1053 - Iztok Banic, Rija Erves, Janez Zerovnik:
The edge fault-diameter of Cartesian graph bundles. 1054-1061 - Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Subdivided graphs as isometric subgraphs of Hamming graphs. 1062-1070 - Bostjan Bresar, Aleksandra Tepeh Horvat:
Cage-amalgamation graphs, a common generalization of chordal and median graphs. 1071-1081 - Éva Czabarka, Peter Dankelmann, László A. Székely:
Diameter of 4-colourable graphs. 1082-1089 - Michel Deza, Sergey V. Shpectorov:
Polyhexes that are l1 graphs. 1090-1100 - Jirí Fiala, Sandi Klavzar, Bernard Lidický:
The packing chromatic number of infinite product graphs. 1101-1113 - Richard H. Hammack:
Proof of a conjecture concerning the direct product of bipartite graphs. 1114-1118 - Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler:
Approximate graph products. 1119-1133 - Abbas Heydari, Bijan Taeri:
Szeged index of TUC4C8(S) nanotubes. 1134-1141 - Wilfried Imrich, Matjaz Kovse:
Lattice embeddings of trees. 1142-1148 - M. H. Khalifeh, Hassan Yousefi-Azari, A. R. Ashrafi, Stephan G. Wagner:
Some new results on distance-based graph invariants. 1149-1163 - Jack H. Koolen, Alice Lesser, Vincent Moulton:
Optimal realizations of generic five-point metrics. 1164-1171 - Henry Martyn Mulder, Ladislav Nebesky:
Axiomatic characterization of the interval function of a graph. 1172-1185 - Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann:
Local Steiner convexity. 1186-1193 - Norbert Polat:
Netlike partial cubes, IV: Fixed finite subgraph theorems. 1194-1204 - Norbert Polat, Gert Sabidussi:
On the geodesic pre-hull number of a graph. 1205-1220
- Catarina P. Avelino, Altino F. Santos:
Spherical f-tilings by scalene triangles and isosceles trapezoids, I. 1221-1244 - David R. Wood:
On tree-partition-width. 1245-1253 - Hacène Belbachir, Miloud Mihoubi:
A generalized recurrence for Bell polynomials: An alternate approach to Spivey and Gould-Quaintance formulas. 1254-1256 - Oleg V. Borodin, Anna O. Ivanova:
List 2-distance (Delta+2)-coloring of planar graphs with girth six. 1257-1262 - Xiuyun Wang, Yan-Quan Feng:
Hexavalent half-arc-transitive graphs of order 4p. 1263-1270 - Yuri A. Bahturin, Amitai Regev, Doron Zeilberger:
Commutation relations and Vandermonde determinants. 1271-1276 - Louis Esperet:
Boxicity of graphs with bounded degree. 1277-1280 - Victor J. W. Guo, Jiang Zeng:
On arithmetic partitions of Zn. 1281-1288 - Young Ho Im, Kyeonghui Lee:
A polynomial invariant of long virtual knots. 1289-1296 - Stephen P. Humphries, Zane Kun Li:
Counting powers of words in monoids. 1297-1308 - Øystein J. Rødseth, James A. Sellers, Helge Tverberg:
Enumeration of the degree sequences of non-separable graphs and connected graphs. 1309-1317 - Miklós Bóna:
On two related questions of Wilf concerning Standard Young Tableaux. 1318-1322 - Primoz Potocnik:
A list of 4-valent 2-arc-transitive graphs and finite faithful amalgams of index (4, 2). 1323-1336 - Hiroshi Maehara, Norihide Tokushige:
From line-systems to sphere-systems - Schläfli's double six, Lie's line-sphere transformation, and Grace's theorem. 1337-1351 - Peter McNamara, Stephanie van Willigenburg:
Positivity results on ribbon Schur function differences. 1352-1369 - Wei Gao, Qing-Hu Hou, Guoce Xin:
On P-partitions related to ordinal sums of posets. 1370-1381 - A. Donald Keedwell:
The existence of Buchsteiner and conjugacy-closed quasigroups. 1382-1385
- Vítezslav Kala, A. Donald Keedwell:
Addendum to "The existence of Buchsteiner and conjugacy-closed quasigroups". 1386
Volume 30, Number 6, August 2009
- Ilia Ponomarenko, Paul-Hermann Zieschang:
Preface. 1387-1391 - Eiichi Bannai, Etsuko Bannai:
A survey on spherical designs and algebraic combinatorics on spheres. 1392-1425 - Harvey I. Blau:
Table algebras. 1426-1455 - Sergei Evdokimov, Ilia Ponomarenko:
Permutation group approach to association schemes. 1456-1476 - Akihide Hanaki:
Representations of finite association schemes. 1477-1496 - William J. Martin, Hajime Tanaka:
Commutative association schemes. 1497-1525 - Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Schur rings. 1526-1539 - Paul-Hermann Zieschang:
Trends and lines of development in scheme theory. 1540-1563
Volume 30, Number 7, October 2009
- Alberto Márquez, Jaroslav Nesetril, Oriol Serra:
Preface. 1565-1567 - Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New results on lower bounds for the number of (<=k)-facets. 1568-1574 - Simeon Ball, András Gács:
On the graph of a function over a prime field whose small powers have bounded degree. 1575-1584 - Marc Cámara, Anna S. Lladó, Jordi Moragas:
On a conjecture of Graham and Häggkvist with the polynomial method. 1585-1592 - Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-colourings in bipartite graphs. 1593-1606 - Javier Cilleruelo, Nils Hebbinghaus:
Discrepancy in generalized arithmetic progressions. 1607-1611 - Marc Comas, Maria J. Serna:
Vertex fusion under distance constraints. 1612-1623 - Jirí Fink:
Matching graphs of hypercubes and complete bipartite graphs. 1624-1629 - Jacob Fox, Benny Sudakov:
Two remarks on the Burr-Erdos conjecture. 1630-1645 - Éric Fusy, Dominique Poulalhon, Gilles Schaeffer:
Bijective counting of plane bipolar orientations and Schnyder woods. 1646-1658 - Delia Garijo, Jaroslav Nesetril, Maria Pastora Revuelta Marchena:
Homomorphisms and polynomial invariants of graphs. 1659-1675 - Jan Kyncl:
Enumeration of simple complete topological graphs. 1676-1685 - Hanno Lefmann:
Generalizations of Heilbronn's triangle problem. 1686-1695 - Jaroslav Nesetril, Patrice Ossona de Mendez:
Fraternal augmentations, arrangeability and linear Ramsey numbers. 1696-1703 - Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing even crossings on surfaces. 1704-1717 - Guy Wolfovitz:
Bounds on the number of maximal sum-free sets. 1718-1723
Volume 30, Number 8, November 2009
- Raul Cordovil, Jorge L. Ramírez Alfonsín:
Preface. 1725-1726 - Louis J. Billera, Ning Jia, Victor Reiner:
A quasisymmetric function for matroids. 1727-1757 - Jürgen Bokowski, David Bremner, Gábor Gévay:
Symmetric matroid polytopes and their generation. 1758-1777 - Jürgen Bokowski, Branko Grünbaum, Lars Schewe:
Topological configurations (n4) exist for all n>=17. 1778-1785 - Jason I. Brown, Bruce E. Sagan:
Monomial bases for broken circuit complexes. 1786-1800 - Josep M. Brunat, António Guedes de Oliveira, Marc Noy:
Partitions of a finite Boolean lattice into intervals. 1801-1809 - Raul Cordovil, Braulio Maia Jr., Manoel Lemos:
The 3-connected binary matroids with circumference 6 or 7. 1810-1824 - Ilda P. F. da Silva:
On minimal non-orientable matroids with 2n elements and rank n. 1825-1832 - David Forge, Adrien Vieilleribière:
The directed switching game on Lawrence oriented matroids. 1833-1834 - David Forge, Thomas Zaslavsky:
On the division of space by topological hyperplanes. 1835-1845 - Jacob Fox, János Pach:
A bipartite analogue of Dilworth's theorem for multiple partial orders. 1846-1853 - Komei Fukuda, Sonoko Moriyama, Yoshio Okamoto:
The Holt-Klee condition for oriented matroids. 1854-1867 - Emeric Gioan, Michel Las Vergnas:
The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region. 1868-1886 - Tibor Jordán, András Recski, Zoltan Szabadka:
Rigid tensegrity labelings of graphs. 1887-1895 - Jim Lawrence:
On the conjectured upper bounds for entries of mutation count matrices. 1896-1901 - Paul Moszkowski:
Involutions and reflection subgroups of finite Coxeter groups. 1902-1912 - Paul Moszkowski:
Addendum to: "Involutions and reflection subgroups of finite Coxeter groups" [European J. Combin.]. 1913-1918 - Jean-Pierre Roudneff:
New cases of Reay's conjecture on partitions of points into simplices with k-dimensional intersection. 1919-1943 - Ileana Streinu, Louis Theran:
Sparse hypergraphs and pebble game algorithms. 1944-1964 - Thom Sulanke, Frank H. Lutz:
Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds. 1965-1979
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
