Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 34
Volume 34, Number 1, February 2014
- Aart Blokhuis, Andries E. Brouwer, Çiçek Güven:
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space. 1-10 - Johannes Carmesin
, Reinhard Diestel, Fabian Hundertmark, Maya Stein:
Connectivity and tree structure in finite graphs. 11-46 - Yoshimi Egawa, Kenta Ozeki:
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. 47-60 - Edita Mácajová, Martin Skoviera:
Sparsely intersecting perfect matchings in cubic graphs. 61-94 - Zeev Nutov:
Approximating minimum-cost edge-covers of crossing biset-families. 95-114 - Jin-Xin Zhou, Yan-Quan Feng:
Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2P. 115-128
Volume 34, Number 2, April 2014
- M. Amin Bahmanian:
Connected Baranyai's theorem. 129-138 - Yair Glasner:
Strong approximation in random towers of graphs. 139-172 - Parikshit Gopalan:
Constructing Ramsey graphs from Boolean function representations. 173-206 - Roi Krakovski:
Topological minors in line graphs - A proof of Zha's conjecture. 207-252 - R. Bruce Richter, Brendan Rooney, Carsten Thomassen:
Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces". 253-254
Volume 34, Number 3, June 2014
- Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner transitive-closure spanners of low-dimensional posets. 255-277 - Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide:
A minimum degree condition forcing complete graph immersion. 279-298 - Zoltán Füredi, Tao Jiang, Robert Seiver:
Exact solution of the hypergraph Turán problem for k-uniform linear paths. 299-322 - Alexandr V. Kostochka, Matthew P. Yancey:
Ore's conjecture for k=4 and Grötzsch's Theorem. 323-329 - Cédric Lecouvey:
Plünnecke and Kneser type theorems for dimension estimates. 331-358 - Amir Shpilka, Avishay Tal:
On the minimal fourier degree of symmetric Boolean functions. 359-377
Volume 34, Number 4, August 2014
- Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht:
Extremal results for odd cycles in sparse pseudorandom graphs. 379-406 - Xavier Dahan:
Regular graphs of large girth and arbitrary degree. 407-426 - Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros:
Measurable events indexed by products of trees. 427-470 - Nathan Linial, Zur Luria:
An upper bound on the number of high-dimensional permutations. 471-486 - Andrew Suk:
Coloring intersection graphs of x-monotone curves in the plane. 487-505
Volume 34, Number 5, October 2014
- József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy:
Partitioning 2-edge-colored graphs by monochromatic paths and cycles. 507-526 - Simon R. Blackburn, Thomas A. McCourt:
Triangulations of the sphere, bitrades and abelian groups. 527-546 - Stephan Brandt, Janina Müttel, Dieter Rautenbach:
The circumference of the square of a connected graph. 547-559 - John Haslegrave:
Judicious partitions of uniform hypergraphs. 561-572 - Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus:
Optimal covers with Hamilton cycles in random graphs. 573-596 - András Sebö, Jens Vygen:
Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. 597-629
Volume 34, Number 6, December 2014
- Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan:
Lower bounds for boxicity. 631-655 - Éric Balandraud, Benjamin Girard:
A nullstellensatz for sequences over Fp. 657-688 - Michael Bennett, Alex Iosevich, Jonathan Pakianathan:
Three-point configurations determined by subsets of Fq2 via the Elekes-Sharir Paradigm. 689-706 - Thilo V. Weinert:
Idiosynchromatic Poetry. 707-742
a service of 
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 2024-04-22 20:03 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
