default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 13
Volume 13, Number 1, 1993
- Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West:
Clique coverings of the edges of a random graph. 1-5 - Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner:
Decomposition of 3-connected graphs. 7-30 - Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures. 31-56 - Paul Erdös, L. Bruce Richmond:
On graphical partitions. 57-63 - András Frank
:
Conservative weightings and ear-decompositions of graphs. 65-81 - George S. Lueker, Mariko Molodowitch:
More analysis of double hashing. 83-96 - Matthias Middendorf, Frank Pfeiffer:
On the complexity of the disjoint paths problems. 97-107 - Alexander F. Sidorenko:
Boundedness of optimal matrices in extremal multigraph and digraph problems. 109-120
- Oleg V. Borodin:
Joint extension of two theorems of Kotzig on 3-polytopes. 121-125 - Zhen Zhang:
A note on arrays of dots wit distinct slopes. 127-128
Volume 13, Number 2, 1993
- Miklós Ajtai, Nathan Linial:
The influence of large coalitions. 129-145 - Béla Bollobás, Graham R. Brightwell:
Cycles through specified vertices. 147-155 - Raul Cordovil, M. L. Moreira:
Bases-cobases graphs and polytopes of matroids. 157-165 - Zoltán Füredi, Jeff Kahn, Paul D. Seymour:
On the fractional matching polytope of a hypergraph. 167-180 - Thomas C. Hales:
Remarks on the density of sphere packings in three dimensions. 181-197 - Peter L. Hammer, Frédéric Maffray:
Preperfect graphs. 199-208 - Stephen Suen:
On depth first search trees in m-out digraphs. 209-229
- Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On kernels in perfect graphs. 231-233 - Joel Friedman:
A note on matrix rigidity. 235-239
Volume 13, Number 3, 1993
- Rudolf Ahlswede, Ning Cai:
A generalization of the AZ identity. 241-248 - Yaakov S. Kupitz:
Separation of a finite set in Rd by spanned hyperplanes. 249-258 - Jürgen Richter-Gebert:
Euclideaness and final polynomials. 259-268 - Yosef Rinott, Michael E. Saks:
Correlation inequalities and a conjecture for permanents. 269-277 - Neil Robertson, Paul D. Seymour, Robin Thomas:
Hadwiger's conjecture for K 6-free graphs. 279-361 - Martin Seysen:
Simultaneous reduction of a lattice basis its reciprocal basis. 363-376
Volume 13, Number 4, 1993
- Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald:
Infinite highly arc transitive digraphs and universal covering digraphs. 377-396 - Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
The hypermetric cone is polydedral. 397-411 - Peter Frankl, Norihide Tokushige:
Weight functions on the kneser graph and the solution of an intersection problem of Sali. 413-420 - Pavol Hell, Huishan Zhou, Xuding Zhu:
Homomorphisms to oriented cycles. 421-433 - Kyriakos Kilakos, Bruce A. Reed:
Fractionally colouring total graphs. 435-440 - Nathan Linial, Michael E. Saks:
Low diameter graph decompositions. 441-454 - Jirí Matousek, Emo Welzl, Lorenz Wernisch:
Discrepancy and approximations for bounded VC-dimension. 455-466 - James G. Oxley, Geoff Whittle:
Some exluded-minor theorems for a class of polymatroids. 467-476 - Karen Seyffarth:
Small cycle double covers of 4-connected planer. 477-482 - Micha Sharir:
k-sets and random hulls. 483-496
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-15 22:37 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:
