The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1996, volume: 66, number: 1

  1. Kyriakos Kilakos
    A Class of Matchings and a Related Lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:1-10 [Journal]
  2. Guoli Ding
    Excluding a Long Double Path Minor. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:11-23 [Journal]
  3. Carsten Thomassen
    Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:24-33 [Journal]
  4. Norio Yamazaki
    Bipartite Distance-Regular Graphs with an Eigenvalue of Multiplicity \itk\rm. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:34-37 [Journal]
  5. Guantao Chen, Paul Erdös, William Staton
    Proof of a Conjecture of Bollob's on Nested Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:38-43 [Journal]
  6. Jean-Pierre Roudneff
    The Maximum Number of Triangles in Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:44-74 [Journal]
  7. Jiuqiang Liu
    Hamiltonian Decompositions of Cayley Graphs on Abelian Groups of Odd Order. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:75-86 [Journal]
  8. Michael B. Dillencourt
    Polyhedra of Small Order and Their Hamiltonian Properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:87-122 [Journal]
  9. Paul A. Catlin, Hong-Jian Lai
    Supereulerian Graphs and the Petersen Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:123-139 [Journal]
  10. Yubao Guo, Lutz Volkmann
    A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:140-145 [Journal]
  11. Jirí Matousek
    Note on the Colored Tverberg Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:146-151 [Journal]
  12. László Pyber
    Covering the Edges of a Connected Graph by Paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:152-159 [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