default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 21
Volume 21, Number 1, 2001
- Ron Aharoni:
Ryser's Conjecture for Tripartite 3-Graphs. 1-4 - Richard Cole, Kirstin Ost, Stefan Schirra:
Edge-Coloring Bipartite Multigraphs in O(E log D) Time. 5-12 - Penny E. Haxell, Vojtech Rödl:
Integer and Fractional Packings in Dense Graphs. 13-38 - Kamal Jain:
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. 39-60 - László Lipták, László Lovász:
Critical Facets of the Stable Set Polytope. 61-88 - Roy Meshulam:
The Clique Complex and Hypergraph Matching. 89-94 - Friedhelm Meyer auf der Heide, Christian Scheideler:
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. 95-138 - Balázs Szegedy:
Tilings of the Square With Similar Right Triangles. 139-144 - Tamás Fleiner:
Note - Uncrossing a Family of Set-Pairs. 145-150
Volume 21, Number 2, 2001
- Noga Alon, János Pach, József Solymosi:
Ramsey-type Theorems with Forbidden Subgraphs. 155-170 - Tom Bohman
, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
Vertex Covers by Edge Disjoint Cliques. 171-197 - Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
On Bipartite Graphs with Linear Ramsey Numbers. 199-209 - Y. Katznelson:
Chromatic Numbers of Cayley Graphs on Z and Recurrence. 211-219 - Daniel J. Kleitman, András Gyárfás, Géza Tóth:
Convex Sets in the Plane with Three of Every Four Meeting. 221-232 - Péter Komjáth:
Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems. 233-238 - Jacob Korevaar:
Tauberian Theorem of Erdos Revisited. 239-250 - Wolfgang Mader:
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. 251-265 - Dieter Rautenbach, Bruce A. Reed:
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. 267-278 - Imre Z. Ruzsa:
Additive Completion of Lacunary Sequences. 279-291 - Norbert Sauer:
Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph. 293-308 - Saharon Shelah:
Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property. 309-319 - Carsten Thomassen:
The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. 321-333
Volume 21, Number 3, 2001
- Maria Axenovich, André Kündgen:
On a Generalized Anti-Ramsey Problem. 335-349 - Stanislav Jendrol', Ingo Schiermeyer:
On a Max-min Problem Concerning Weights of Edges. 351-359 - Odile Marcotte:
Optimal Edge-Colourings for a Class of Planar Multigraphs. 361-394 - Bojan Mohar:
Existence of Polyhedral Embeddings of Graphs. 395-401 - Oleg Pikhurko:
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. 403-412 - Károly Podoski:
Groups Covered by an Infinite Number of Abelian Subgroups. 413-416 - Carsten Thomassen:
Totally Odd K4-subdivisions in 4-chromatic Graphs. 417-443 - Tamás Fleiner:
The Size of 3-Cross-Free Families. 445-448 - Gohar M. Kyureghyan:
note: On a Degree Property of Cross-Intersecting Families. 449-453
Volume 21, Number 4, 2001
- László Babai, Thomas P. Hayes, Peter G. Kimmel:
The Cost of the Missing Bit: Communication Complexity with Help. 455-488 - Christian Houdré:
Mixed and Isoperimetric Estimates on the Log-Sobolev Constants of Graphs and Markov Chains. 489-513 - Alexandr V. Kostochka, Douglas R. Woodall:
Density Conditions for Panchromatic Colourings of Hypergraphs. 515-541 - Monique Laurent:
On the Sparsity Order of a Graph and Its Deficiency in Chordality. 543-570 - Guglielmo Lunardon:
Linear k-blocking Sets. 571-581 - Roman Nedela, Martin Skoviera:
Cayley Snarks and Almost Simple Groups. 583-590 - Yonutz Stanchescu:
An Upper Bound for d-dimensional Difference Sets. 591-595
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-04 22:09 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:
