default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 5, 1996
Volume 5, 1996
- Colin Cooper, Alan M. Frieze, Michael Molloy, Bruce A. Reed:
Perfect Matchings in Random r-regular, s-uniform Hypergraphs. 1-14 - Keith Edwards:
The Harmonious Chromatic Number of Bounded Degree Trees. 15-28 - Zoltán Füredi:
An Upper Bound on Zarankiewicz' Problem. 29-33 - Mihály Hujter, Zsolt Tuza:
Precoloring Extension 3: Classes of Perfect Graphs. 35-56 - Kyriakos Kilakos, F. Bruce Shepherd:
Excluding Minors in Cubic Graphs. 57-78 - János Komlós, Endre Szemerédi:
Topological cliques in graphs 2. 79-90 - Tomaz Slivnik:
Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph. 91-94 - C. C. Chen, G. P. Jin:
Cycle Partitions in Graphs. 95-97 - Amanda G. Chetwynd
, Roland Häggkvist:
An Improvement of Hind's Upper Bound on the Total Chromatic Number. 94-104 - Anant P. Godbole, Daphne E. Skipper, Rachel A. Sunley:
t-Covering Arrays: Upper Bounds and Poisson Approximations. 105-117 - W. T. Gowers:
An Almost m-wise Independed Random Permutation of the Cube. 119-130 - Valery A. Liskovets:
Some Asymptotical Estimates for Planar Eulerian Maps. 131-138 - Claudia Neuhauser:
A Phase Transition for the Distribution of Matching Blocks. 139-159 - Laurent Saloff-Coste, Wolfgang Woess:
Computing Norms of group-Invariant Transition Operators. 161-178 - Carsten Thomassen:
K5-Subdivisions in Graphs. 179-189 - Martin Anthony, Peter L. Bartlett, Yuval Ishai, John Shawe-Taylor:
Valid Generalisation from Approximate Interpolation. 191-214 - Colin Cooper:
Asymptotic Enumeration of Predicate-Junction Flowgraphs. 215-226 - Bradley S. Gubser:
A Characterization of Almost-Planar Graphs. 227-245 - C. Douglas Howard:
Orthogonality of Measures Induced by Random Walks with Scenery. 247-256 - Wojciech Kordecki:
Small Submatroids in Random Matroids. 257-266 - Aleksandar Sasa Pekec:
A Winning Strategy for the Ramsey Graph Game. 267-276 - Bruce A. Reed:
Paths, Stars and the Number Three. 277-295 - Rachid Saad:
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. 297-306 - Janusz Szuster, Pawel Wlaz, Jerzy Zurawiecki:
On Recognition of Shift Registers. 307-315 - Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev:
Predecessors in Random Mappings. 317-335 - Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Hypercubes with Random Link and Node Failures. 337-350 - Robert P. Dobrow, James Allen Fill:
Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. 351-371 - Konrad Engel:
Interval Packing and Covering in the Boolean Lattice. 373-384 - Roland Häggkvist:
Restricted Edge-colourings of Bipartite Graphs. 385-392 - Norbert Hegyvári:
Subset sums in N2. 393-402 - Ewa M. Kubicka:
An Efficient Method of Examining all Trees. 403-413 - John Shawe-Taylor:
Fast String Matching in Stationary Ergodic Sources. 415-427 - Zdzislaw Skupien:
Smallest sets of Longest Paths with Empty Intersection. 429-436 - Carsten Thomassen:
On the Number of Hamiltonian Cycles in Bipartite Graphs. 437-442
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-05 22:24 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:
