The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1987, volume: 66, number: 3

  1. Francisco Barahona, Michele Conforti
    A construction for binary matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:213-218 [Journal]
  2. Albrecht Beutelspacher, Klaus Metsch
    Embedding finite linear spaces in projective planes, II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:219-230 [Journal]
  3. Martin Farber, Robert E. Jamison
    On local convexity in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:231-247 [Journal]
  4. Martin Farber
    Bridged graphs and geodesic convexity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:249-257 [Journal]
  5. Jeanette P. Schmidt
    Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:259-277 [Journal]
  6. Tamás Szonyi
    Note on the order of magnitude of k for complete k-arcs in PG(2, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:279-282 [Journal]
  7. Zhe-xian Wan, Rong-hua Xiong
    Existence of self-reverse-dual m-sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:283-288 [Journal]
  8. Mark E. Watkins, James B. Shearer
    Counterexamples to two conjectures about distance sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:289-298 [Journal]
  9. Serge Lavrenchenko
    An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:299-301 [Journal]
  10. László Babai
    On the Nonuniform Fisher Inequality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:303-307 [Journal]
  11. András Gyárfás, Zsolt Tuza
    An upper bound on the Ramsey number of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:309-310 [Journal]
  12. Martin Kochol
    Construction of crossing-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:311-313 [Journal]
  13. Ioan Tomescu
    Graphical Eulerian numbers and chromatic generating functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:315-318 [Journal]
  14. F. Sterboul
    Letter to the editor. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:319-320 [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