default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 33
Volume 33, Number 1, January 2012
- Dawei He, Changhong Lu:
A conjecture on the number of SDRs of a (t, n)-family. 1-7 - Heidi Gebauer:
On the clique-game. 8-19 - Toufik Mansour
, Shashikant Mulay, Mark Shattuck:
A general two-term recurrence and its solution. 20-26 - Mykhaylo Tyomkyn:
An improved bound for the Manickam-Miklós-Singhi conjecture. 27-32 - Adonus L. Madison, Junhua Wu:
On binary codes from conics in PG(2, q). 33-48 - M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter:
Counting s(3+1)-avoiding permutations. 49-61 - Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversals and domination in uniform hypergraphs. 62-72 - João Paulo Costalonga:
On 3-connected minors of 3-connected matroids and graphs. 72-81 - Tristan Jenkinson, John Kenneth Truss, Daniel Seidel:
Countable homogeneous multipartite graphs. 82-109
Volume 33, Number 2, February 2012
- Heesung Shin, Jiang Zeng:
The symmetric and unimodal expansion of Eulerian polynomials via continued fractions. 111-127 - Mark H. Siggers, Norihide Tokushige:
The maximum size of intersecting and union families of sets. 128-138 - Jin-Xin Zhou, Yan-Quan Feng:
Edge-transitive cyclic regular covers of the Möbius-Kantor graph. 139-147 - Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Child's addition in the Stern-Brocot tree. 148-167 - Carl Johan Casselgren:
Coloring graphs from random lists of size 2. 168-181 - Xinmin Hou, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Z3-connectivity of 4-edge-connected 2-triangular graphs. 182-188 - Valentin Féray:
Partial Jucys-Murphy elements and star factorizations. 189-198 - Bodo Lass:
The algebra of set functions II: An enumerative analogue of Hall's theorem for bipartite graphs. 199-214 - Vanessa Chatelain, Jorge L. Ramírez Alfonsín:
The switching game on unions of oriented matroids. 215-219 - Sandi Klavzar, Sergey V. Shpectorov:
Asymptotic number of isometric generalized Fibonacci cubes. 220-226 - Bodo Lass:
The algebra of set functions I: The product theorem and duality. 227-236 - Stefko Miklavic, Primoz Sparl:
On the connectivity of bipartite distance-balanced graphs. 237-247 - Markus Kuba, Alois Panholzer:
Bilabelled increasing trees and hook-length formulae. 248-258 - Ju-Mok Oh:
The number of chains of subgroups of a finite cyclic group. 259-266 - Jonah Blasiak:
An insertion algorithm for catabolizability. 267-276
Volume 33, Number 3, April 2012
- A. Machì, Jaroslav Nesetril, Patrice Ossona de Mendez, Jorge L. Ramírez Alfonsín:
Preface. 277-278 - Hubert de Fraysseix, Patrice Ossona de Mendez:
Trémaux trees and planarity. 279-293 - Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho:
Cyclic colorings of plane graphs with independent faces. 294-301 - Olivier Bernardi, Juanjo Rué:
Enumerating simplicial decompositions of surfaces with boundaries. 302-325 - Markus Chimani, Petr Hlinený, Petra Mutzel:
Vertex insertion approximates the crossing number of apex graphs. 326-335 - Jan Kyncl:
Ramsey-type constructions for arrangements of segments. 336-339 - Bojan Mohar, Simon Spacapan:
Degenerate and star colorings of graphs on surfaces. 340-349 - Jaroslav Nesetril, Patrice Ossona de Mendez, David R. Wood:
Characterisations and examples of graph classes with bounded expansion. 350-373 - Bruce A. Reed, David R. Wood:
Polynomial treewidth forces a large grid-like-minor. 374-379 - S. A. Tishchenko:
Maximum size of a planar graph with given degree and even diameter. 380-396 - S. A. Tishchenko:
N-separators in planar graphs. 397-407 - Csaba D. Tóth:
Connectivity augmentation in planar straight line graphs. 408-425
Volume 33, Number 4, May 2012
- Anna S. Lladó, Jordi Moragas:
On the modular sumset partition problem. 427-434 - Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu:
Adapted game colouring of graphs. 435-445 - Pietro Mongelli:
On the total positivity of restricted Stirling numbers. 446-448 - Choongbum Lee, Benny Sudakov:
Hamiltonicity, independence number, and pancyclicity. 449-457 - David Saxton:
Supersaturation for hereditary properties. 458-462 - Seyed S. Mousavi, Violeta Leoreanu Fotea, Morteza Jafarpour, H. Babaei:
Equivalence relations in semihypergroups and the corresponding quotient structures. 463-473 - Gábor Ivanyos, François Le Gall, Yuichi Yoshida:
On the distance between non-isomorphic groups. 474-476 - James Haglund, Mirkó Visontai:
Stable multivariate Eulerian polynomials and generalized Stirling permutations. 477-487 - Gwenaël Joret, David R. Wood:
Nordhaus-Gaddum for treewidth. 488-490 - William Y. C. Chen, Neil J. Y. Fan, Alina F. Y. Zhao:
Partitions and partial matchings avoiding neighbor patterns. 491-504 - Woong Kook:
A multicomplex of partially edge-rooted forests. 505-509 - William Y. C. Chen, Daniel K. Du, Charles B. Mei:
Combinatorial telescoping for an identity of Andrews on parity in partitions. 510-518 - Akihiro Munemasa, Hiroki Tamura:
The codes and the lattices of Hadamard matrices. 519-533 - Vadim V. Lozin, Colin Mayhill, Victor Zamaraev:
Locally bounded coverings and factorial properties of graphs. 534-543 - Roman Glebov, Yury Person, Wilma Weps:
On extremal hypergraphs for Hamiltonian cycles. 544-555 - Wuxing Cai, Naihuan Jing:
Applications of a Laplace-Beltrami operator for Jack polynomials. 556-571 - Fan Wei:
Product decompositions of the symmetric group induced by separable permutations. 572-582 - Péter Csikvári:
Two remarks on the adjoint polynomial. 583-591 - Sokol Ndreca, Aldo Procacci, Benedetto Scoppola:
Improved bounds on coloring of graphs. 592-609 - Nathan Reading:
Generic rectangulations. 610-623 - Dong Ye, Cun-Quan Zhang:
Cycle double covers and the semi-Kotzig frame. 624-631 - Vincent Pilaud, Francisco Santos:
The brick polytope of a sorting network. 632-662 - Xiao-Chuan Liu:
On flushed partitions and concave compositions. 663-678 - Zdenek Dvorák, Daniel Král':
Classes of graphs with small rank decompositions are X-bounded. 679-683
Volume 33, Number 5, July 2012
- Jaroslav Nesetril, André Raspaud:
Preface. 685-687 - Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao:
Tree-representation of set families and applications to combinatorial decompositions. 688-711 - Michel Habib, Juraj Stacho:
Reduced clique graphs of chordal graphs. 712-735 - Hossein Teimoori Faal, Martin Loebl:
Bass' identity and a coin arrangements lemma. 736-742 - Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
The colorful Helly theorem and general hypergraphs. 743-749 - Daniela Kühn, Deryk Osthus:
A survey on Hamilton cycles in directed graphs. 750-766 - Louis Esperet, Frantisek Kardos, Daniel Král':
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. 767-798 - Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
A stability theorem on fractional covering of triangles by edges. 799-806 - Codrut Grosu, Jan Hladký:
The extremal function for partial bipartite tilings. 807-815 - Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Hypergraphs with many Kneser colorings. 816-843 - Zoltán Füredi, Attila Sali:
Some new bounds on partition critical hypergraphs. 844-852 - Jacob Fox, János Pach:
Coloring Kk-free intersection graphs of geometric objects in the plane. 853-866 - Edita Rollová, Martin Skoviera:
Nowhere-zero flows in Cartesian bundles of graphs. 867-871 - Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Application of polynomial method to on-line list colouring of graphs. 872-883 - Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored pebble motion on graphs. 884-892 - Friedrich Eisenbrand, Martin Niemeier:
Coloring fuzzy circular interval graphs. 893-904 - Min Chen, André Raspaud, Weifan Wang:
Vertex-arboricity of planar graphs without intersecting triangles. 905-923 - Tomás Kaiser, Petr Vrána:
Hamilton cycles in 5-connected line graphs. 924-947 - Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos:
Outerplanar obstructions for a feedback vertex set. 948-968 - Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Forbidden graphs for tree-depth. 969-979
Volume 33, Number 6, August 2012
- Valérie Berthé, Dirk Frettlöh, Víctor F. Sirvent:
Selfdual substitutions in dimension one. 981-1000 - Xin Gui Fang, Sanming Zhou:
Gossiping and routing in second-kind Frobenius graphs. 1001-1014 - Changping Wang:
Subdigraphs with orthogonal factorizations of digraphs. 1015-1021 - Sandra R. Kingan, Manoel Lemos:
Matroids with at least two regular elements. 1022-1029 - Hiroaki Taniguchi, Satoshi Yoshiara:
A new construction of the d-dimensional Buratti-Del Fra dual hyperoval. 1030-1042 - Klavdija Kutnar, Dragan Marusic, Cui Zhang:
Hamilton paths in vertex-transitive graphs of order 10p. 1043-1077 - Rong Luo, Rui Xu, Gexin Yu:
An extremal problem on group connectivity of graphs. 1078-1085 - Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Fast embedding of spanning trees in biased Maker-Breaker games. 1086-1099 - Deborah Chun, James G. Oxley, Geoff Whittle:
Capturing matroid elements in unavoidable 3-connected minors. 1100-1112 - Andrzej P. Kisielewicz, Krzysztof Przeslawski:
Rigidity and the chessboard theorem for cube packings. 1113-1119 - Matthias Lenz:
Hierarchical zonotopal power ideals. 1120-1141 - Pu Gao, Yi Su, Nicholas C. Wormald:
Induced subgraphs in sparse random graphs with given degree sequences. 1142-1166 - Guus Regts:
The rank of edge connection matrices and the dimension of algebras of invariant tensors. 1167-1173 - Andries E. Brouwer, Oktay Olmez, Sung-Yell Song:
Directed strongly regular graphs from -designs. 1174-1177 - Michael Giudici, Cai Heng Li, Geoffrey Pearce, Cheryl E. Praeger:
Basic and degenerate pregeometries. 1178-1189 - Peter R. W. McNamara, Stephanie van Willigenburg:
Maximal supports and Schur-positivity among connected skew shapes. 1190-1206 - Jaroslav Nesetril, Robert Sámal:
Tension continuous maps - Their structure and applications. 1207-1225 - Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood:
Small minors in dense graphs. 1226-1245 - Matjaz Urlep:
Triple intersection numbers of Q-polynomial distance-regular graphs. 1246-1252 - Konrad Engel, Caterina Nardi:
Solution of a problem on non-negative subset sums. 1253-1256 - François Descouens, Hideaki Morita, Yasuhide Numata:
On a bijective proof of a factorization formula for Macdonald polynomials. 1257-1264 - Zihui Liu, Xiangyong Zeng:
On a kind of two-weight code. 1265-1272 - Peter J. Cameron, Maximilien Gadouleau:
Remoteness of permutation codes. 1273-1285 - Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Bipartizing fullerenes. 1286-1293 - Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Immersing complete digraphs. 1294-1302 - Jun-Yang Zhang, Shao-Fei Du:
On the orientable regular embeddings of complete multipartite graphs. 1303-1312 - Gabe Cunningham:
Constructing self-dual chiral polytopes. 1313-1323
Volume 33, Number 7, October 2012
- Tullio Ceccherini-Silberstein:
Preface. 1325-1329 - Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp:
Groups, graphs, languages, automata, games and second-order monadic logic. 1330-1368 - Philippe Aubry, Annick Valibouze:
Algebraic computation of resolvents without extraneous powers. 1369-1385 - Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Recent results on syntactic groups of prefix codes. 1386-1401 - Mariagrazia Bianchi, Marcel Herzog, Emanuele Pacifici, Giulio Saffirio:
On the regularity of a graph related to conjugacy classes of groups. 1402-1407 - Ievgen V. Bondarenko, Tullio Ceccherini-Silberstein, Alfredo Donno, Volodymyr Nekrashevych:
On a family of Schreier graphs of intermediate growth associated with a self-similar group. 1408-1421 - Daniele D'Angeli, Alfredo Donno:
Appendix: Gelfand pairs associated with the action of G. 1422-1426 - Alexander I. Bufetov, Alexey Klimenko:
On Markov operators and ergodic theorems for group actions. 1427-1443 - Leonardo Cangelmi:
A Riemann-Roch theorem for hypermaps. 1444-1448 - Tullio Ceccherini-Silberstein, Wolfgang Woess:
Context-free pairs of groups I: Context-free pairs and graphs. 1449-1466 - Robert Cori, Michel Marcus, Gilles Schaeffer:
Odd permutations are nicer than even ones. 1467-1478 - Michele D'Adderio, Luca Moci:
Ehrhart polynomial and arithmetic Tutte polynomial. 1479-1483 - Daniele D'Angeli, Alfredo Donno, Tatiana Nagnibeda:
Counting dimer coverings on self-similar Schreier graphs. 1484-1513 - Aldo de Luca:
A standard correspondence on epicentral words. 1514-1536 - Ira M. Gessel, Antonio Restivo, Christophe Reutenauer:
A bijection between words and multisets of necklaces. 1537-1546 - Daniele A. Gewurz, Francesca Merola:
Numeration and enumeration. 1547-1556 - Dina Ghinelli:
Characterization of some 4-gonal configurations of Ahrens-Szekeres type. 1557-1573 - Rostislav I. Grigorchuk, Piotr W. Nowak:
Diameters, distortion, and eigenvalues. 1574-1587 - Gareth A. Jones:
Hypermaps and multiply quasiplatonic Riemann surfaces. 1588-1605 - Mario Marietti, Damiano Testa:
Conical and spherical graphs. 1606-1618 - Pablo Martín, David Singerman:
The geometry behind Galois' final theorem. 1619-1630 - Sevak Mkrtchyan:
Asymptotics of the maximal and the typical dimensions of isotypic components of tensor representations of the symmetric group. 1631-1652 - Kyoji Saito:
Opposite power series. 1653-1671 - Olivier Siegenthaler, Amaia Zugadi-Reizabal:
The equations satisfied by GGS-groups and the abelian group structure of the Gupta-Sidki group. 1672-1690 - Zoran Sunic:
Twin Towers of Hanoi. 1691-1707
Volume 33, Number 8, November 2012
- Alexander Kolpakov:
Deformation of finite-volume hyperbolic Coxeter polyhedra, limiting growth rates and Pisot numbers. 1709-1724 - Tsai-Lien Wong, Jiaojiao Wu, Xuding Zhu:
Total weight choosability of Cartesian product of graphs. 1725-1738 - Youn-Seo Choi, Byungchan Kim:
Partition identities from third and sixth order mock theta functions. 1739-1754 - Martin Knor, Primoz Potocnik:
Efficient domination in cubic vertex-transitive graphs. 1755-1764 - Ping Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Spanning cycles in regular matroids without small cocircuits. 1765-1776 - Charalampos Tsitouras, Christos G. Massouros:
Enumeration of Rosenberg-type hypercompositional structures defined by binary relations. 1777-1786 - Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez, Rafael Villarroel-Flores:
On the structure of the h-vector of a paving matroid. 1787-1799 - Gareth A. Jones, Young Soo Kwon:
Classification of nonorientable regular embeddings of Hamming graphs. 1800-1807 - Seong-Hun Paeng:
Volume and diameter of a graph and Ollivier's Ricci curvature. 1808-1819 - Mamadou Moustapha Kanté:
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs. 1820-1841 - Sukhada Fadnavis:
On Brenti's conjecture about the log-concavity of the chromatic polynomial. 1842-1846 - Marién Abreu, Domenico Labbate, John Sheehan:
Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs. 1847-1856 - Carmen Amarra, Michael Giudici, Cheryl E. Praeger:
Quotient-complete arc-transitive graphs. 1857-1881 - Tao Jiang, Manley Perkel, Dan Pritikin:
Arrangements of k-sets with intersection constraints. 1882-1899 - Henning Bruhn, Paul Wollan:
Finite connectivity in infinite matroids. 1900-1912 - Evgeny Feigin:
The median Genocchi numbers, q-analogues and continued fractions. 1913-1918 - Jessica Striker, Nathan Williams:
Promotion and rowmotion. 1919-1942 - Nathan Keller:
A simple reduction from a biased measure on the discrete cube to the uniform measure. 1943-1957 - Hao Li, Guanghui Wang:
Color degree and heterochromatic cycles in edge-colored graphs. 1958-1964 - Igor Dolinka, Dragan Masulovic:
Countable homogeneous linearly ordered posets. 1965-1973 - Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular maps with nilpotent automorphism groups. 1974-1986 - Ira M. Gessel, Zhicong Lin, Jiang Zeng:
Jacobi-Stirling polynomials and P-partitions. 1987-2000
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-10-29 01:40 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:
