default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 3, 1994
Volume 3, 1994
- David K. Arrowsmith, John W. Essam:
Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs. 1-11 - József Beck:
Deterministic Graphs Games and a Probabilistic Intuition. 13-26 - Sergei L. Bezrukov:
On Oriented Embedding of the Binary tree into the Hypercube. 27-38 - Colin Cooper, Alan M. Frieze, Michael Molloy:
Hamilton Cycles in Random Regular Digraphs. 39-49 - Reinhard Diestel, Imre Leader:
The Growth of Infinite Graphs: Boundedness and Finite Spreading. 51-55 - Péter L. Erdös, Ákos Seress, László A. Székely:
On Intersecting Chains in Boolean Algebras. 57-62 - Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman:
On the Maximum Number of Triangles in Wheel-Free Graphs. 63-75 - Mario Gionfriddo, Salvatore Milici, Zsolt Tuza:
Blocking Sets in SQS(2u). 77-86 - Roland Häggkvist, Anders Johansson:
(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. 87-95 - Svante Janson:
The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. 97-126 - Jaroslav Nesetril
, Pavel Valtr:
A Ramsey-type Theorem in the Plane. 127-135 - D. J. A. Welsh:
Randomised Approximation in the Tutte Plane. 137-143 - Ron Aharoni, Reinhard Diestel:
Menger's Theorem for a Countable Source Set. 145-156 - Martin Aigner, Regina Klimmek:
Matchings in Lattice Graphs and Hamming Graphs. 157-165 - Andrew D. Barbour, Simon Tavaré:
A Rate for the Erdös-Turán Law. 167-176 - Walter A. Deuber, Wolfgang Thumser:
A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies. 177-190 - Michel Deza, Viatcheslav P. Grishukhin:
Lattice Points of Cut Cones. 191-214 - J. Keith Dugdale, Anthony J. W. Hilton:
Amalgemated Factorizations of Complete Graphs. 215-231 - Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
On Triangle Contact Graphs. 233-246 - János Komlós, Endre Szemerédi:
Topological Cliques in Graphs. 247-256 - Wolfgang Mader:
On Vertex-Edge-Critically n-Connected Graphs. 257-271 - J. D. Annan:
A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs. 273-283 - Yossi Azar:
Lower Bounds for Insertion Methods for TSP. 285-292 - Paul Erdös, András Gyárfás, Tomasz Luczak:
Independet Transversals in Sparse Partite Hypergraphs. 293-296 - Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey Theorems and Kp-Independence Numbers. 297-325 - Peter L. Hammer, Alexander K. Kelmans:
On Universal Threshold Graphs. 327-344 - Abba M. Krieger, Paul R. Rosenbaum:
A Stochastic Comparisor for Arrangement Increasing Functions. 345-348 - Michael Krivelevich:
Ks-Free Graphs Without Large Kr-Free Subgraphs. 349-354 - Manoel Lemos:
Non-Binary Madroids Having At Most Three Non-Binary Elements. 355-369 - Allan D. Mills:
A Matroid Reconstruction Result. 371-373 - Bojan Mohar:
Obstructions for the Disk and the Cylinder Embedding Extension Problems. 375-406 - Alon Nilli:
Perfect Hashing and Probability. 407-409 - Andrzej Pelc:
Almost Safe Group Testing with Few Tests. 411-419 - Prasad Tetali:
An Extension of Foster's Network Theorem. 421-427 - Rudolf Ahlswede, Ning Cai:
On Partitioning and Packing Products with Rectangles. 429-434 - Neal Brand, Steve Jackson:
Properties of Classes of Random Graphs. 435-454 - Moshe Dubiner, Uri Zwick:
How Do Read-Once Formulae Shrink? 455-469 - J. M. Hammersley, Giuseppe Mazzarino:
Properties of Large Eden Clusters in the Plane. 471-505 - Claus-Peter Schnorr:
Block Reduced Lattice Bases and Successive Minima. 507-522 - Farhad Shahrokhi, László A. Székely:
On Canonical Concurrent Flows, Crossing Number and Graph Expansion. 523-543 - Arthur T. White:
An Introduction to Random Topological Graphs Theory. 545-555
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-12 01:26 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:
