default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 5
Volume 5, Number 1, 1985
- Jeremy E. Dawson
:
Decomposition of binary matroids. 1-9 - Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
Extremal hypergraph problems and convex hulls. 11-26 - Zoltán Füredi:
Set-systems with three intersections. 27-31 - Chris D. Godsil:
Inverses of trees. 33-39 - András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt:
On the sum of the reciprocals of cycle lengths in sparse graphs. 41-52 - Ervin Györi:
Covering simply connected regions by rectangles. 53-55 - János Komlós:
Linear verification for spanning trees. 57-65 - László Pyber:
An Erdös - Gallai conjecture. 67-79 - Jeanette P. Schmidt, Eli Shamir:
Component structure in the evolution of random hypergraphs. 81-94
Volume 5, Number 2, 1985
- Jürgen Bierbrauer, Albrecht Brandis:
On generalized Ramsey numbers for trees. 95-107 - Knut Deimer:
A new upper bound for the length of snakes. 109-120 - Mohamed M. El-Zahar, Norbert Sauer:
The chromatic number of the product of two 4-chromatic graphs is 4. 121-126 - Hubert de Fraysseix, Pierre Rosenstiehl:
A characterization of planar graphs by Trémaux orders. 127-135 - András Hajnal:
The chromatic number of the product of two Alef i - Chromatic Graphs can be countable. 137-139 - Peter L. Hammer, Nadimpalli V. R. Mahadev, Dominique de Werra:
The struction of a graph: Application to CN-free graphs. 141-147 - Stephen C. Locke:
A generalization of Dirac's theorem. 149-159 - Wolfgang Mader:
Degree and local connectivity in digraphs. 161-165 - B. L. Rothschild, Ernst G. Straus:
On triangulations of the convex hull of n points. 167-179
Volume 5, Number 3, 1985
- Ron Aharoni:
Fractional matchings and covers in infinite hypergraphs. 181-184 - William H. Cunningham:
On submodular function minimization. 185-192 - András Gyárfás, Jenö Lehel, Zsolt Tuza:
How many atoms can be defined by boxes. 193-204 - D. J. Hajela, Paul D. Seymour:
Counting points in hypercubes and convolution measure algebras. 205-214 - Melvin Hausner:
Inclusion-exclusion inequalities. 215-225 - G. Koester:
Note to a problem of T. Gallai and G. A. Dirac. 227-228 - Alexandr V. Kostochka:
Maximum set of edges no two covered by a clique. 229-236 - Bernt Lindström:
A Desagruesian theorem for algebraic combinatorial geometries. 237-239 - James B. Shearer:
On a problem of spencer. 241-245 - Éva Tardos:
A strongly polynomial minimum cost circulation algorithm. 247-256 - Andrew Vince, Michelle L. Wachs:
A shellable poset that is not lexicographically shellable. 257-260 - Heinz-Jürgen Voss:
Independent sets in k-chromatic graphs. 261-269
Volume 5, Number 4, 1985
- Richard William Decker, Henry H. Glover, John Philip Huneke:
Computing the genus of the 2-amalgamations of graphs. 271-282 - Reinhard Diestel, Rudolf Halin, Walter Vogler:
Some remarks on universal graphs. 283-293 - Mohamed M. El-Zahar, Paul Erdös:
On the existence of two non-neighboring subgraphs in a graph. 295-300 - Konrad Engel, Nikolai N. Kuzjurin:
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. 301-309 - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Multipartite graph - space graph Ramsey numbers. 311-318 - Jeff Kahn:
A problem of P. Seymour on nonbinary matroids. 319-323 - Alexander V. Karzanov:
Families of cuts with the MFMC-property. 325-336 - Henry J. Landau, Benjamin F. Logan, Larry A. Shepp:
An inequality conjectured by Hajela and Seymour arising in combinatorial geometry. 337-342 - James G. Oxley:
Proof of a conjecture of Kahn for non-binary matroids. 343-345 - László Pyber:
Regular subgraphs of dense graphs. 347-349 - S. S. Shrikhande, N. M. Singhi:
On a problem of Erdös and Larson. 351-358 - Karsten Steffens:
Maximal tight sets and the Edmonds - Gallai decomposition for matchings. 359-365 - Robert Endre Tarjan:
Sequential access in play trees takes linear time. 367-378
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-01-15 20:36 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:
