|
|
Journals in DBLP
Combinatorica
2002, volume: 22, number: 3
- Ron Aharoni, Eli Berger, Ran Ziv
A Tree Version of Konig's Theorem. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:335-343 [Journal]
- Michael R. Capalbo
Small Universal Graphs for Bounded-Degree Planar Graphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:345-359 [Journal]
- Uriel Feige, Christian Scheideler
Improved Bounds for Acyclic Job Shop Scheduling. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:361-399 [Journal]
- Martin Henk, Robert Weismantel
Diophantine Approximations and Integer Points of Cones. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:401-408 [Journal]
- Andreas Huck, Eberhard Triesch
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:409-416 [Journal]
- Chi-Jen Lu
Improved Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:417-434 [Journal]
- Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:435-443 [Journal]
- Juan José Montellano-Ballesteros, Victor Neumann-Lara
An Anti-Ramsey Theorem. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:445-449 [Journal]
- Frantisek Franek
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:451-454 [Journal]
- Anna Galluccio, Luis A. Goddyn
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2002, v:22, n:3, pp:455-459 [Journal]
|
