The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1981, volume: 30, number: 1

  1. Yahya Ould Hamidoune
    Quelques problèmes de connexité dans les graphes orientés. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:1-10 [Journal]
  2. Richard P. Anstee
    An analogue of group divisible designs for Moore graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:11-20 [Journal]
  3. Daniel A. Marcus
    Spanning subgraphs of k-connected digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:21-31 [Journal]
  4. Peter Hammond
    q-Coverings, codes, and line graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:32-35 [Journal]
  5. Carsten Thomassen
    Planar cubic hypohamiltonian and hypotraceable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:36-44 [Journal]
  6. David G. Kirkpatrick, Derek G. Corneil
    Forest embeddings in regular graphs of large girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:45-60 [Journal]
  7. Martin Feinberg
    On a generalization of linear independence in finite-dimensional vector spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:61-69 [Journal]
  8. Charles Grinstead
    The strong perfect graph conjecture for toroifal graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:70-74 [Journal]
  9. Dominique Sotteau
    Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:75-81 [Journal]
  10. Kenneth A. Berman
    Three-colourings of planar 4-valent maps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:82-88 [Journal]
  11. E. M. Wright
    Burnside's lemma: A historical note. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:89-90 [Journal]
  12. D. Perrin, Marcel Paul Schützenberger
    A conjecture on sets of differences of integer pairs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:91-93 [Journal]
  13. William H. Cunningham
    On matroid connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:94-99 [Journal]
  14. François Bry
    Note on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:100-102 [Journal]
  15. C. Zaverdinos
    Hall-conditions and the three-family problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:103-107 [Journal]
  16. Yahya Ould Hamidoune
    On multiply critically h-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:108-112 [Journal]
  17. Jochen Harant, Hansjoachim Walther
    On the radius of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:113-117 [Journal]
  18. Roland Häggkvist, G. G. Nicoghossian
    A remark on Hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:118-120 [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