The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1988, volume: 44, number: 1

  1. Alain Quilliot
    On the problem of how to represent a graph taking into account an additional structure. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:1-21 [Journal]
  2. Richard P. Anstee, Martin Farber
    On bridged graphs and cop-win graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:22-28 [Journal]
  3. Bojan Mohar
    Embeddings of infinite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:29-43 [Journal]
  4. Charles H. C. Little
    Cubic combinatorial maps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:44-63 [Journal]
  5. Gary Gordon
    Algebraic characteristic sets of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:64-74 [Journal]
  6. Peter Horák
    Subgraphs intersecting any hamiltonian cycle. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:75-86 [Journal]
  7. Ron Aharoni
    Matchings in infinite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:87-125 [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