The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1992, volume: 54, number: 2

  1. Mark N. Ellingham, Gordon F. Royle
    Vertex-switching reconstruction of subgraph numbers and triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:167-177 [Journal]
  2. Miroslaw Truszczynski
    Generalized local colorings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:178-188 [Journal]
  3. Ilia Krasikov, Yehuda Roditty
    Switching reconstruction and diophantine equations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:189-195 [Journal]
  4. Serge Lawrencenko
    The variety of triangular embeddings of a graph in the projective plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:196-208 [Journal]
  5. Jozef Sirán, Pavol Gvozdjak
    Kuratowski-type theorems do not extend to pseudosurfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:209-212 [Journal]
  6. Mikio Kano, Norihide Tokushige
    Binding numbers and f-factors of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:213-221 [Journal]
  7. Reinhard Diestel
    The structure of TKa-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:222-238 [Journal]
  8. Mark Ramras
    Symmetric vertex partitions of hypercubes by isometric trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:239-248 [Journal]
  9. Dan Archdeacon, Nora Hartsfield
    Self-dual embeddings of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:249-256 [Journal]
  10. Ron Aharoni, Menachem Magidor, Richard A. Shore
    On the strength of König's duality theorem for infinite bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:257-290 [Journal]
  11. Bill Jackson, Nicholas C. Wormald
    Longest cycles in 3-connected planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:291-321 [Journal]
  12. Carsten Thomassen
    Infinite connected graphs with no end-preserving spanning trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:322-324 [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