The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1984, volume: 37, number: 3

  1. Ron Aharoni
    A generalization of Tutte's 1-factor theorem to countable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:199-209 [Journal]
  2. Medha Dhurandhar
    Characterization of quadratic and cubic sigma-polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:210-220 [Journal]
  3. Geng-Hua Fan
    New sufficient conditions for cycles in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:221-227 [Journal]
  4. Robert C. Brigham, Ronald D. Dutton
    Bounds on graph spectra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:228-234 [Journal]
  5. Emo Welzl
    Symmetric graphs and interpretations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:235-244 [Journal]
  6. Carsten Thomassen
    A refinement of Kuratowski's theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:245-253 [Journal]
  7. Kathryn Fraughnaugh Jones
    Independence in graphs with maximum degree four. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:254-269 [Journal]
  8. Bruce Hedman
    Clique graphs of time graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:270-278 [Journal]
  9. Jeff Kahn
    A family of perfect graphs associated with directed graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:279-282 [Journal]
  10. Abdelkader Khelladi, Charles Payan
    Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:283-289 [Journal]
  11. Takao Asano, Takao Nishizeki, Paul D. Seymour
    A note on nongraphic matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:290-293 [Journal]
  12. George R. T. Hendry
    Maximum non-path-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:294-298 [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