default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 32
Volume 32, Number 1, January 2011
- Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in bipartite graphs obtained from Boolean lattices. 1-9 - Yi Wang, Bao-Xuan Zhu
:
On the unimodality of independence polynomials of some graphs. 10-20 - Hongliang Lu, Qinglin Yu, Cun-Quan Zhang:
Vertex-coloring 2-edge-weighting of graphs. 21-27 - Gábor Bacsó, Zsolt Tuza:
Optimal guard sets and the Helly property. 28-32 - Béla Bollobás, Vladimir Nikiforov:
Large joints in graphs. 33-44 - Stefan Felsner, Kolja B. Knauer:
Distributive lattices, polyhedra, and generalized flows. 45-59 - Stefan Felsner, Ricardo Gómez Aiza, Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
Cubic time recognition of cocircuit graphs of uniform oriented matroids. 60-66 - Masato Kobayashi:
The maximum number of atoms of Bruhat intervals in the symmetric groups. 67-71 - Irina Cristea, Mirela Stefanescu, Carmen Angheluta:
About the fundamental relations defined on the hypergroupoids associated with binary relations. 72-81 - Gi-Sang Cheon, Hana Kim, Louis W. Shapiro:
The hitting time subgroup, Lukasiewicz paths and Faber polynomials. 82-91 - Jun Ma, Yeong-Nan Yeh:
Refinements of (n, m)-Dyck paths. 92-99 - Yoann Gelineau, Heesung Shin, Jiang Zeng:
Bijections for Entringer families. 100-115 - Gregor Dolinar, Alexander E. Guterman, Bojan Kuzma, Marko Orel:
On the Polya permanent problem over finite fields. 116-132 - K. Thirusangu, Atulya K. Nagar, R. Rajeswari:
Labelings in Cayley digraphs. 133-139 - Peter Borg:
On Chvátal's conjecture and a conjecture on families of signed sets. 140-145 - Jonathan Browder, Steven Klee:
Lower bounds for Buchsbaum* complexes. 146-153
Volume 32, Number 2, February 2011
- Hajime Tanaka, Rie Tanaka:
Nonexistence of exceptional imprimitive Q-polynomial association schemes with six classes. 155-161 - Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Global Maker-Breaker games on sparse graphs. 162-177 - João Araújo, Michael K. Kinyon, Janusz Konieczny:
Minimal paths in the commuting graphs of semigroups. 178-197 - Fabrizio Caselli, Roberta Fulci:
Refined Gelfand models for wreath products. 198-216 - William Y. C. Chen, Neil J. Y. Fan, Teresa X. S. Li:
Han's bijection via permutation codes. 217-225 - Takayuki Hibi, Akihiro Higashitani, Yuuki Nagazawa:
Ehrhart polynomials of convex polytopes with small volumes. 226-232 - Antonio Breda d'Azevedo, Maria Elisa Fernandes:
Classification of primer hypermaps with a prime number of hyperfaces. 233-242 - Daniele D'Angeli, Alfredo Donno:
Generalized crested products of Markov chains. 243-257 - Yu-Ru Liu, Craig V. Spencer, Xiaomei Zhao:
A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II). 258-264 - Yan-Quan Feng, Yan-Tao Li:
One-regular graphs of square-free order of prime valency. 265-275 - János Barát, Péter Hajnal, Eszter K. Horváth:
Elementary proof techniques for the maximum number of islands. 276-281 - Sherry H. F. Yan:
On a conjecture about enumerating (2+2)-free posets. 282-287 - Sun Kim, Ae Ja Yee:
Göllnitz-Gordon identities and parity questions. 288-293 - Craig E. Larson:
The critical independence number and an independence decomposition. 294-300 - Thomas Bier, Imed Zaguia:
Commutativity conditions for groups arising from acyclic directed graphs and posets. 301-307 - Jean-Paul Bultel:
A one-parameter deformation of the Farahat-Higman algebra. 308-323 - Suil O, Douglas B. West:
Matching and edge-connectivity in regular graphs. 324-329 - Brendon Rhoades:
Enumeration of connected Catalan objects by type. 330-338
Volume 32, Number 3, April 2011
- Emanuele Delucchi:
Modular elimination in matroids and oriented matroids. 339-343 - Gabriela Araujo-Pardo, Camino Balbuena, Luis Montejano, Juan Carlos Valenzuela:
Partial linear spaces and identifying codes. 344-351 - Alexander Araluze, Klavdija Kutnar, Luis Martínez, Dragan Marusic:
Edge connectivity in difference graphs and some new constructions of partial sum families. 352-360 - Lenny Fukshansky, Achill Schürmann:
Bounds on generalized Frobenius numbers. 361-368 - Yidong Sun, Xiaojuan Wu:
The largest singletons of set partitions. 369-382 - Mathieu Dutour Sikiric, Anna Felikson, Pavel Tumarkin:
Automorphism groups of root system matroids. 383-389 - Alexandr Kazda:
Maltsev digraphs have a majority polymorphism. 390-397 - Michel Mollard:
On perfect codes in Cartesian products of graphs. 398-403 - Viviana Ene, Jürgen Herzog, Fatemeh Mohammadi:
Monomial ideals and toric rings of Hibi type arising from a finite poset. 404-421 - Laura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez:
Some inequalities for the Tutte polynomial. 422-433 - Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Randić index and the diameter of a graph. 434-442 - Tsz Ho Chan:
On sets of integers, none of which divides the product of k others. 443-447 - Weikang Qian, Marc D. Riedel, Ivo G. Rosenberg:
Uniform approximation and Bernstein polynomials with coefficients in the unit interval. 448-463 - Qingde Kang, Jiuqiang Liu, Larry X. W. Wang:
Restricted t-wise L-intersecting families on set systems. 464-471 - Rui Pedro Carpentier:
On signed diagonal flip sequences. 472-477 - Gareth A. Jones:
Maps related to Grigorchuk's group. 478-494
Volume 32, Number 4, May 2011
- Mark N. Ellingham, Xiaoya Zha:
Orientable embeddings and orientable cycle double covers of projective-planar graphs. 495-509 - Fabien Vignes-Tourneret:
Non-orientable quasi-trees for the Bollobás-Riordan polynomial. 510-532 - Paul N. Balister, Ervin Györi, Richard H. Schelp:
Coloring vertices and edges of a graph by nonempty subsets of a set. 533-537 - Riccardo Biagioli, Jiang Zeng:
Enumerating wreath products via Garsia-Gessel bijections. 538-553 - Geoffrey Exoo, Robert Jajcay:
On the girth of voltage graph lifts. 554-562 - Sylvie Corteel, Jang Soo Kim:
Combinatorics on permutation tableaux of type A and type B. 563-579 - Matjaz Konvalinka:
The weighted hook-length formula II: Complementary formulas. 580-597 - Gholam Reza Omidi, Ghaffar Raeisi:
A note on the Ramsey number of stars - Complete graphs. 598-599 - Jaroslav Nesetril, Patrice Ossona de Mendez:
On nowhere dense graphs. 600-617 - Jean-Christophe Novelli, Christophe Reutenauer, Jean-Yves Thibon:
Generalized descent patterns in permutations and associated Hopf algebras. 618-627 - Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. 628-638 - Zubeyir Cinkir:
The tau constant and the discrete Laplacian matrix of a metrized graph. 639-655
Volume 32, Number 5, July 2011
- John H. Elton, Theodore P. Hill:
A stronger conclusion to the classical ham sandwich theorem. 657-661 - Bofeng Huo, Xueliang Li, Yongtang Shi:
Complete solution to a conjecture on the maximal energy of unicyclic graphs. 662-673 - Douglas B. West:
A short proof of the Berge-Tutte Formula and the Gallai-Edmonds Structure Theorem. 674-676 - Klas Markström, Andrzej Rucinski:
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. 677-687 - Allison B. Lewko, Mark Lewko:
On the structure of sets of large doubling. 688-708
Volume 32, Number 6, August 2011
- Gary Gordon, James G. Oxley:
Preface. 709-711 - Gary Gordon, Jennifer McNulty:
Thomas H. Brylawski (1944-2007). 712-721 - Joseph E. Bonin, William R. Schmitt:
Splicing matroids. 722-744 - Allison Cuttler, Curtis Greene, Mark A. Skandera:
Inequalities for symmetric means. 745-761 - Carolyn Chun, James G. Oxley:
Unavoidable parallel minors of regular matroids. 762-774 - Yuanan Diao, Gábor Hetyei, Kenneth Hinson:
A Tutte-style proof of Brylawski's tensor product formula. 775-781 - Joanna A. Ellis-Monaghan, Irasema Sarmiento:
A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan. 782-794 - Jim Geelen:
Small cocircuits in matroids. 795-801 - Rhiannon Hall, Dillon Mayhew, Stefan H. M. van Zwam:
The excluded minors for near-regular matroids. 802-830 - Joseph P. S. Kung, Gordon F. Royle:
Graphs whose flow polynomials have only integral roots. 831-840 - Winfried Hochstättler, Robert Nickel:
Joins of oriented matroids. 841-852 - Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu:
Obstructions to a binary matroid being graphic. 853-860 - Manoel Lemos, Talmage James Reid, Haidong Wu:
On the circuit-spectrum of binary matroids. 861-869 - Jim Lawrence:
Enumeration in torus arrangements. 870-881 - Dillon Mayhew, Mike Newman, Dominic Welsh, Geoff Whittle:
On the asymptotic proportion of connected matroids. 882-890 - Dillon Mayhew, Bogdan Oporowski, James G. Oxley, Geoff Whittle:
The excluded minors for the class of matroids that are binary or ternary. 891-930 - Brigitte Servatius, Herman Servatius:
On the 2-sum in rigidity matroids. 931-936 - Richard P. Stanley:
Two enumerative results on cycles of permutations. 937-943 - Lorenzo Traldi:
Binary nullity, Euler circuits and interlace polynomials. 944-950
Volume 32, Number 7, October 2011
- László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver:
Preface. 951-953 - Peter Tittmann, Ilya Averbouch, Johann A. Makowsky:
The enumeration of vertex induced subgraphs with respect to the number of components. 954-974 - Itai Benjamini, Nicolas Curien:
On limits of graphs sphere packed in Euclidean space and applications. 975-984 - Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi:
Limits of randomly grown graph sequences. 985-999 - Sourav Chatterjee, S. R. S. Varadhan:
The large deviation principle for the Erdős-Rényi random graph. 1000-1017 - Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Interleaved adjoints of directed graphs. 1018-1024 - Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Distinguishing graphs by their left and right homomorphism profiles. 1025-1053 - Svante Janson:
Quasi-random graphs and graph limits. 1054-1083 - Vít Jelínek, Martin Klazar:
Embedding dualities for set partitions and for relational structures. 1084-1096 - Swastik Kopparty, Benjamin Rossman:
The homomorphism domination exponent. 1097-1114 - Russell Lyons, Fedor Nazarov:
Perfect matchings as IID factors on non-amenable groups. 1115-1125 - Jaroslav Nesetril, Patrice Ossona de Mendez:
How many F's are there in G? 1126-1141 - Oleg Pikhurko:
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. 1142-1155 - Balázs Szegedy:
Limits of kernel operators and the spectral regularity lemma. 1156-1167 - Xuding Zhu:
The fractional version of Hedetniemi's conjecture is true. 1168-1175
Volume 32, Number 8, November 2011
- Le Anh Vinh:
The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields. 1177-1181 - Oleg R. Musin, Hiroshi Nozaki:
Bounds on three- and higher-distance sets. 1182-1190 - Takuro Abe, Hiroaki Terao:
The freeness of Shi-Catalan arrangements. 1191-1198 - James G. Oxley:
On bipartite restrictions of binary matroids. 1199-1202 - Zsolt Lángi:
On the Hadwiger numbers of starlike disks. 1203-1212 - Xiangneng Zeng, Pingzhi Yuan:
Indexes of long zero-sum sequences over cyclic groups. 1213-1221 - Bostjan Bresar, Tanja Gologranc:
On a local 3-Steiner convexity. 1222-1235 - Daniel Pinto:
The duality index of oriented regular hypermaps. 1236-1243 - Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood:
On the maximum number of cliques in a graph embedded in a surface. 1244-1252 - Gábor Hetyei, Christian Krattenthaler:
The poset of bipartitions. 1253-1281 - Helmut Prodinger, Carsten Schneider, Stephan G. Wagner:
Unfair permutations. 1282-1298 - Ruth Kellerhals, Geneviève Perren:
On the growth of cocompact hyperbolic Coxeter groups. 1299-1316 - Ewa Drgas-Burchardt:
On prime inductive classes of graphs. 1317-1328 - Feng-Juan Chen, Yong-Gao Chen:
On minimal asymptotic bases. 1329-1335 - David J. Grynkiewicz:
Note on a conjecture of Graham. 1336-1344 - Jaromy Scott Kuhl, Tristan Denley:
Some partial Latin cubes and their completions. 1345-1352 - Robert Brijder, Hendrik Jan Hoogeboom:
The group structure of pivot and loop complementation on graphs and set systems. 1353-1367 - Serguei Norine, Peter Whalen:
Jacobians of nearly complete and threshold graphs. 1368-1376 - Simon Spacapan:
The k-independence number of direct products of graphs and Hedetniemi's conjecture. 1377-1383 - Bart De Bruyn:
The hyperplanes of finite symplectic dual polar spaces which arise from projective embeddings. 1384-1393 - Colin McDiarmid:
On graphs with few disjoint t-star minors. 1394-1406 - Péter Csikvári, Mohammad Reza Oboudi:
On the roots of edge cover polynomials of graphs. 1407-1416 - Magdalena Lysakowska, Krzysztof Przeslawski:
On the structure of cube tilings and unextendible systems of cubes in low dimensions. 1417-1427 - Julien Cassaigne, Sébastien Ferenczi, Luca Q. Zamboni:
Combinatorial trees arising in the study of interval exchange transformations. 1428-1444
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-12-05 22:23 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:
