default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 12
Volume 12, Number 1, 1992
- Rudolf Ahlswede, Ning Cai, Zhen Zhang:
Diametric theorems in seuence spaces. 1-17 - Vasek Chvátal, Colin McDiarmid:
Small transversals in hypergraphs. 19-26 - William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid:
On integer points in polyhedra. 27-37 - Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor:
Bounds for arrays of dots with distinct slopes or lengths. 39-44 - Alexander K. Kelmans:
Spanning trees of extended graphs. 45-51 - Gary L. Miller, Vijaya Ramachandran:
A new graph triconnectivity algorithm and its parallelization. 53-76 - Tomaz Pisanski, Thomas W. Tucker, Dave Witte:
The non-orientable genus of some metacyclic groups. 77-87 - Alexander Pott:
New necessary conditions on the existence of abelian difference sets. 89-93 - Rajamani Sundar:
On the Deque conjecture for the splay algorithm. 95-124
Volume 12, Number 2, 1992
- Noga Alon, Michael Tarsi:
Colorings and orientations of graphs. 125-134 - Imre Bárány, Roger Howe, László Lovász:
On integer points in polyhedra: a lower bound. 135-142 - Aart Blokhuis, Ákos Seress, Henny A. Wilbrink:
Characterization of complete exterior sets of conics. 143-147 - David M. Jackson, L. Bruce Richmond:
The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line. 149-153 - Jeff Kahn, Paul D. Seymour
:
A fractional version of the Erdös-Faber-Lovász conjecture. 155-160 - Ravi Kannan:
Lattice translates of a polytope and the Frobenius problem. 161-177 - János Körner, Gábor Simonyi, Zsolt Tuza:
Perfect couples of graphs. 179-192 - Kevin McAvaney, Jack M. Robertson, William A. Webb:
Ramsey partitions of integers and fair divisions. 193-201 - Peter McMullen, Egon Schulte:
Regular polytopes of type {4, 4, 3} and {4, 4, 4}. 203-220 - Pavel Pudlák, Vojtech Rödl:
A combinatorial approach to complexity. 221-226 - Tamás Szonyi:
Note on the existence of large minimal blocking sets in Galois planes. 227-235
- Takayuki Hibi:
Dual polytopes of rational convex polytopes. 237-240 - Gyula Y. Katona:
Searching for f-Hamiltonian circuits. 241-246
Volume 12, Number 3, 1992
- Ron M. Adin:
Counting colorful multi-dimensional trees. 247-260 - Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The number of edges of many faces in a line segment arrangement. 261-274 - Patrick Chiu:
Cubic Ramanujan graphs. 275-285 - Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely:
Sharpening the LYM inequality. 287-293 - Péter Hajnal, Mario Szegedy:
On packing bipartite graphs. 295-301 - Ron Holzman, Daniel J. Kleitman:
Sign vectors and unit vectors. 303-316 - Thomas Dale Porter:
On a bottleneck bipartition conjecture of Erdös. 317-321 - Wansoo T. Rhee, Michel Talagrand:
Packing random items of three colors. 331-350
- Attila Sali:
Some intersection theorems. 351-361 - Amha Tume Lisan:
Multi-dimensional Ramsey theorems - an example. 363-365 - Dezsö Miklós:
Disproof of a conjecture in graph reconstruction theory. 367-369
Volume 12, Number 4, 1992
- Paul Erdös:
In memory of Tibor Gallai. Comb. 12(4): 373-374 (1992) - Noga Alon, Colin McDiarmid, Bruce A. Reed:
Star arboricity. 375-380 - Vladimir G. Boltyanski, P. S. Soltan:
A solution of Hadwiger's covering problem for zonoids. 381-388 - Jin-yi Cai, Martin Fürer, Neil Immerman:
An optimal lower bound on the number of variables for graph identification. 389-410 - Ehud Hrushovski:
Extending partial isomorphisms of graphs. 411-416 - Jeff Kahn:
On a problem of Erdös and Lovász: random lines in a projective plane. 417-423 - Siu Lun Ma:
Reversible relative difference sets. 425-432 - Ernst W. Mayr, C. Greg Plaxton:
On the spanning trees of weighted graphs. 433-447 - Noam Nisan:
Pseudorandom generators for space-bounded computation. 449-461 - Hans Jürgen Prömel, Angelika Steger:
The asymptotic number of graphs not containing a fixed color-critical subgraph. 463-473 - Thomas Stehling:
On computing the number of subgroups of a finite Abelian group. 475-480 - Carsten Thomassen:
The Hadwiger number of subgroups vertex-transitive graphs. 481-492
- Peter Frankl:
The convex hull of antichains in posets. 493-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-11-04 00:27 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:
