The SCEAS System
Navigation Menu

Journals in DBLP

Combinatorica
1989, volume: 9, number: 4

  1. Egon Balas, William R. Pulleyblank
    The perfectly matchable subgraph polytope of an arbitrary graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:321-337 [Journal]
  2. Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin
    Some new strongly regular graphs . [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:339-344 [Journal]
  3. Fan R. K. Chung, Ronald L. Graham, Richard M. Wilson
    Quasi-random graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:345-362 [Journal]
  4. Alan M. Frieze, Colin J. H. McDiarmid
    On random minimum lenght spanning trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:363-374 [Journal]
  5. Alexander Schrijver
    The Klein bottle and multicommodity flows. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:375-384 [Journal]
  6. Gábor Tardos
    Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:385-392 [Journal]
  7. Noga Alon, Michael Tarsi
    A nowhere-zero point in liner mappings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:393-396 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002