The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1994, volume: 62, number: 1

  1. Ephraim Korach
    Two-Trees Optimal T-Join and Integral Packing of T-Cuts. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:1-10 [Journal]
  2. Carsten Thomassen
    Five-Coloring Graphs on the Torus. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:11-33 [Journal]
  3. Armen S. Asratian, R. R. Kamalian
    Investigation on Interval Edge-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:34-43 [Journal]
  4. Moshe Morgenstern
    Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:44-62 [Journal]
  5. Manfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet
    Set-Homogeneous Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:63-95 [Journal]
  6. Fan R. K. Chung, David Mumford
    Chordal Completions of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:96-106 [Journal]
  7. Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam
    Abstract and Generic Rigidity in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:107-113 [Journal]
  8. Robin Thomas, Xingxing Yu
    4-Connected Projective-Planar Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:114-132 [Journal]
  9. Richard A. Brualdi, Keith L. Chavey, Bryan L. Shader
    Bipartite Graphs and Inverse Sign Patterns of Strong Sign-Nonsingular Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:133-150 [Journal]
  10. Colin Cooper, Alan M. Frieze
    Hamilton Cycles in a Class of Random Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:151-163 [Journal]
  11. Miki Shimabara Miyauchi
    Topological Ramsey Theorem for Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:164-179 [Journal]
  12. Carsten Thomassen
    Every Planar Graph Is 5-Choosable. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:180-181 [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