default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 108
Volume 108, Numbers 1-3, October 1992
- Jaroslav Nesetril
:
Z. Frolík and his winter schools. 1-2 - Bohuslav Balcar, Petr Simon:
Reaping number and pi-character of Boolean algebras. 5-12 - A. Fedeli, Jan Reiterman, Anna Tozzi:
Onwalpha-compactness. 13-23 - Antonio Fernández, Vladimír Müller:
Embedding of a separable locally pseudoconvex algebra into a locally pseudoconvex algebra with two generators. 25-30 - János Gerlits, András Hajnal, Zoltán Szentmiklóssy:
On the cardinality of certain Hausdorff spaces. 31-35 - Joseph Gil, William L. Steiger, Avi Wigderson:
Geometric medians. 37-51 - Thomas Jech:
The logarithmic distribution of leading digits and finitely additive measures. 53-57 - Igor Kríz:
All trapezoids are Ramsey. 59-62 - Jan Paseka:
Products in the category of locales: which properties are preserved? 63-73 - Jan Pelant, Vojtech Rödl:
On coverings of infinite- dimentional metric spaces. 75-81 - Hans Jürgen Prömel, Bernd Voigt:
From wqo to bqo, via Ellentuck's theorem. 83-106 - Ales Pultr:
Notes on an extension of the structure of frame. 107-114 - Pavel Valtr:
Sets in Rd with no large empty convex subsets. 115-124 - Peter Vojtás:
Cardinalities of noncentered systems of subsets of omega. 125-129 - Jirí Adámek, Jirí Rosický:
On orthogonal subcategories of locally presentable categories. 133-137 - Anders Björner, Johan Karlander:
Invertibility of the base Radon transform of a matroid. 139-147 - Miroslav Fiedler:
An extremal problem for the spectral radius of a graph. 149-158 - Wilfried Imrich, Jaroslav Nesetril:
Simple tournaments and sharply transitive groups. 159-165 - Hiroshi Maehara:
Extending a flexible unit-bar framework to a rigid one. 167-174 - Vlastimil Pták:
Thickness of families of sets and a minimax lemma. 175-181 - András Recski:
Applications of combinatorics to statics - a second survey. 183-188 - Jozef Sirán, Martin Skoviera:
Groups with sign structure and their antiautomorphisms. 189-202 - Vera Trnková:
Endomorphisms of undirected modifications of directed graphs. 203-209 - Jirí Vinárek:
Simultaneous representations of groups. 211-216 - Radek Adamec, Martin Klazar, Pavel Valtr:
Generalized Davenport-Schinzel sequences with linear upper bound. 219-229 - Lars Døvling Andersen:
The strong chromatic index of a cubic graph is at most 10. 231-252 - Peter Bugata:
Trahtenbrot-Zykov problem and NP-completeness. 253-259 - Richard A. Duke, Paul Erdös, Vojtech Rödl:
Cycle-connected graphs. 261-278 - Paul Erdös, Tibor Gallai, Zsolt Tuza:
Covering the cliques of a graph with vertices. 279-289 - Peter Frankl:
On cross-intersecting families. 291-295 - Pavol Hell, Donald J. Miller:
Achromatic numbers and graph operations. 297-305 - Svante Janson, Jan Kratochvíl:
Thresholds for classes of intersection graphs. 307-326 - Jozef Jirásek:
Some remarks on Ádám's conjecture for simple directed graphs. 327-332 - Martin Loebl:
Unprovable combinatorial statements. 333-342 - Jirí Matousek, Robin Thomas:
On the complexity of finding iso- and other morphisms for partial k-trees. 343-364 - Matthias Middendorf, Frank Pfeiffer:
The max clique problem in classes of string-graphs. 365-372 - Václav Nýdl:
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs. 373-377 - Svatopluk Poljak, Daniel Turzík:
Max-cut in circulant graphs. 379-392 - Alexander A. Razborov:
The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear. 393-396 - Zsolt Tuza:
Asymptotic growth of sparse saturated structures is locally determined. 397-402
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-12-19 22:16 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:
