default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 35
Volume 35, January 2014
- Ervin Györi, Jaroslav Nesetril
, Attila Sali:
Preface. 1 - Abhijin Adiga, L. Sunil Chandran, Rogers Mathew:
Cubicity, degeneracy, and crossing number. 2-12 - Marie Albenque, Éric Fusy, Dominique Poulalhon:
On symmetric quadrangulations and triangulations. 13-31 - Gadi Aleksandrowicz, Gill Barequet:
The growth rate of high-dimensional tree polycubes. 32-38 - Kazuyuki Amano:
On extremal kk-CNF formulas. 39-50 - Richard P. Anstee, Miguel Raggi, Attila Sali:
Forbidden configurations: Boundary cases. 51-66 - Spencer Backman:
Infinite reduction of divisors on metric graphs. 67-74 - József Balogh, Ping Hu, Bernard Lidický, Hong Liu:
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. 75-85 - B. V. Subramanya Bharadwaj, Sathish Govindarajan, Karmveer Sharma:
On the Erdős-Szekeres n-interior-point problem. 86-94 - Aart Blokhuis, Andries E. Brouwer, Tamás Szonyi:
Maximal cocliques in the Kneser graph on point-plane flags in PG(4, q). 95-104 - Marianna Bolla:
Modularity spectra, eigen-subspaces, and structure of weighted graphs. 105-116 - Peter Borg:
The maximum sum and the maximum product of sizes of cross-intersecting families. 117-130 - Ameera Chowdhury:
A note on the Manickam-Miklós-Singhi conjecture. 131-140 - Demetres Christofides, Klas Markström:
The range of thresholds for diameter 2 in random Cayley graphs. 141-154 - Jian Ding, Eyal Lubetzky, Yuval Peres:
Anatomy of the giant component: The strictly supercritical regime. 155-168 - Asaf Ferber, Dan Hefetz:
Weak and strong kk-connectivity games. 169-183 - David G. Ferguson, Tomás Kaiser, Daniel Král':
The fractional chromatic number of triangle-free subcubic graphs. 184-220 - Jirí Fink, Petr Gregor:
Linear extension diameter of level induced subposets of the Boolean lattice. 221-231 - Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. 232-244 - Shinya Fujita, Ken-ichi Kawarabayashi:
A connected subgraph maintaining high connectivity. 245-255 - Radoslav Fulek, Slobodan Mitrovic:
Homometric sets in trees. 256-263 - Zoltán Füredi:
Linear trees in uniform hypergraphs. 264-272 - Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
On the number of BB-flows of a graph. 273-285 - Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos:
Lift-contractions. 286-296 - Luca Gugelmann, Reto Spöhel:
On balanced coloring games in random graphs. 297-312 - David Hartman, Jan Hubicka, Dragan Masulovic:
Homomorphism-homogeneous LL-colored graphs. 313-323 - Nils Hebbinghaus, Anand Srivastav:
Discrepancy of (centered) arithmetic progressions in ZpZp. 324-334 - Pavol Hell:
Graph partitions with prescribed patterns. 335-353 - Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. 354-373 - Zoltán Király:
Monochromatic components in edge-colored complete uniform hypergraphs. 374-376 - Sergey Kitaev, Anna de Mier, Marc Noy:
On the number of self-dual rooted maps. 377-387 - Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
A graph-theoretical axiomatization of oriented matroids. 388-391 - Uwe Leck, Ian T. Roberts:
Inequalities for cross-unions of collections of finite sets. 392-401 - Gary MacGillivray, André Raspaud, Jacobus Swarts:
Obstructions to locally injective oriented improper colourings. 402-412 - Colin McDiarmid, Tobias Müller:
The number of disk graphs. 413-431 - Kenta Ozeki, Petr Vrána:
2-edge-Hamiltonian-connectedness of 4-connected plane graphs. 432-448 - Arnaud Pêcher, Annegret K. Wagler:
Computing the clique number of aa-perfect graphs in polynomial time. 449-458 - Oriol Serra, Lluís Vena:
On the number of monochromatic solutions of integer linear systems on abelian groups. 459-473 - Noah Streib, William T. Trotter:
Dimension and height for posets with planar cover graphs. 474-489 - Richard M. Wilson, Tony W. H. Wong:
Diagonal forms of incidence matrices associated with tt-uniform hypergraphs. 490-508
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 2026-07-31 23:19 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
