default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 22
Volume 22, Number 1, 2002
- Alon Amit, Nathan Linial:
Random Graph Coverings I: General Theory and Graph Connectivity. 1-18 - Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic:
Perfect Graphs, Partitionable Graphs and Cutsets. 19-33 - Christian Delhommé, Norbert Sauer:
Homomorphisms of Products of Graphs into Graphs Without Four Cycles. 35-46 - András Frank
, Zoltán Király:
Graph Orientations with Edge-connection and Parity Constraints. 47-70 - Mekkia Kouider, Maryvonne Mahéo:
Connected [a, b]-factors in Graphs. 71-82 - Erez Petrank, Gábor Tardos:
On the Knowledge Complexity of NP. 83-121 - Amnon Ta-Shma:
Almost Optimal Dispersers. 123-145 - Ya-Chen Chen, Zoltán Füredi:
Hamiltonian Kneser Graphs. 147-149
Volume 22, Number 2, 2002
- Krishnaswami Alladi, Alexander Berkovich:
A Double Bounded Version of Schur's Partition Theorem. 151-168 - József Beck:
Positional Games and the Second Moment Method. 169-216 - Fan R. K. Chung, Ronald L. Graham:
Sparse Quasi-Random Graphs. 217-244 - Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy:
Combinatorial and Arithmetical Properties of Linear Numeration Systems. 245-267 - András Gyárfás, Alice Hubenko, József Solymosi:
Large Cliques in C4-Free Graphs. 269-274 - Alexandr V. Kostochka:
Transversals in Uniform Hypergraphs with Property (p, 2). 275-285 - Penny E. Haxell, Tomasz Luczak, P. W. Tingley:
Ramsey Numbers for Trees of Small Maximum Degree. 287-320 - Pavel Pudlák:
Cycles of Nonzero Elements in Low Rank Matrices. 321-334
Volume 22, Number 3, 2002
- Ron Aharoni, Eli Berger, Ran Ziv:
A Tree Version of Konig's Theorem. 335-343 - Michael R. Capalbo:
Small Universal Graphs for Bounded-Degree Planar Graphs. 345-359 - Uriel Feige, Christian Scheideler:
Improved Bounds for Acyclic Job Shop Scheduling. 361-399 - Martin Henk, Robert Weismantel:
Diophantine Approximations and Integer Points of Cones. 401-408 - Andreas Huck, Eberhard Triesch:
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. 409-416 - Chi-Jen Lu:
Improved Pseudorandom Generators for Combinatorial Rectangles. 417-434 - Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic:
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z. 435-443 - Juan José Montellano-Ballesteros, Victor Neumann-Lara:
An Anti-Ramsey Theorem. 445-449 - Frantisek Franek:
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6. 451-454 - Anna Galluccio, Luis A. Goddyn:
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. 455-459
Volume 22, Number 4, October 2002
- Uriel Feige, Oleg Verbitsky:
Error Reduction by Parallel Repetition - A Negative Result. 461-478 - András Gyárfás:
Transitive Edge Coloring of Graphs and Dimension of Lattices. 479-496 - Nathan Linial, Alex Samorodnitsky:
Linear Codes and Character Sums. 497-522 - J. H. Boutet de Monvel, O. C. Martin:
Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space. 523-530 - Jean François Maurras:
From Membership to Separation, a Simple Construction. 531-536 - Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Convex Embeddings and Bisections of 3-Connected Graphs 1. 537-554 - Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. 555-574 - Zoltán Szigeti:
Perfect Matchings Versus Odd Cuts. 575-589 - Carsten Thomassen:
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. 591-596
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-23 19: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:
