The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1991, volume: 52, number: 1

  1. Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang
    The Hamiltonian property of generalized de Bruijn digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:1-8 [Journal]
  2. Anthony J. W. Hilton
    The total chromatic number of nearly complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:9-19 [Journal]
  3. Yoshimi Egawa, R. Glas, Stephen C. Locke
    Cycles and paths through specified vertices in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:20-29 [Journal]
  4. Gena Hahn, Eric C. Milner, Robert E. Woodrow
    Infinite friendship graphs with infinite parameters. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:30-41 [Journal]
  5. Bert Fassbender
    On a generalization of a theorem of Nash-Williams. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:42-44 [Journal]
  6. Jason I. Brown, Vojtech Rödl
    A ramsey type problem concerning vertex colourings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:45-52 [Journal]
  7. Jan Kratochvíl
    String graphs. I. The number of critical nonstring graphs is infinite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:53-66 [Journal]
  8. Jan Kratochvíl
    String graphs. II. recognizing string graphs is NP-hard. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:67-78 [Journal]
  9. Yair Caro, Zsolt Tuza
    Hypergraph coverings and local colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:79-85 [Journal]
  10. Igor Kríz, Robin Thomas
    The menger-like property of the tree-width of infinite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:86-91 [Journal]
  11. Zsolt Tuza
    Extensions of Gallai's graph covering theorems for uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:92-96 [Journal]
  12. Jaroslav Ivanco
    An interpolation theorem for partitions which are indivisible with respect to cohereditary properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:97-101 [Journal]
  13. Miroslav Petrovic
    On graphs with exactly one eigenvalue less than -1. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:102-112 [Journal]
  14. Rephael Wenger
    Extremal graphs with no C4's, C6's, or C10's. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:113-116 [Journal]
  15. Stanislav Riha
    A new proof of the theorem by Fleischner. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:117-123 [Journal]
  16. Jozef Sirán, Martin Skoviera
    Characterization of the maximum genus of a signed graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:124-146 [Journal]
  17. Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman
    On the thickness and arboricity of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:147-151 [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