The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1990, volume: 84, number: 1

  1. Frank E. Bennett, Lisheng Wu, Lie Zhu
    Further results on incomplete (3, 2, 1)- conjugate orthogonal idempotent Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:1-14 [Journal]
  2. Michael Gilpin, Robert Shelton
    Predicates whose maximal length functions increase periodically. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:15-21 [Journal]
  3. Peter Horák, Jozef Sirán
    Solution of two problems of P. Erdös concerning Hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:23-29 [Journal]
  4. Lih-Hsing Hsu
    Generalized homomorphism graph functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:31-37 [Journal]
  5. Elzbieta B. Jarrett
    Two families of graphs satisfying the cycle basis interpolation property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:39-46 [Journal]
  6. Ronald C. Mullin, Douglas R. Stinson
    Pairwise balanced designs with odd block sizes exceeding five. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:47-62 [Journal]
  7. Sadao Saito, Takanori Hayasaka
    Langford sequences: Some connections with complete and additive permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:63-70 [Journal]
  8. Paul C. van Oorschot, Scott A. Vanstone
    On splitting sets in block designs and finding roots of polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:71-85 [Journal]
  9. Dave Witte
    Hamilton-decomposable graphs and digraphs of infinite valence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:87-100 [Journal]
  10. Jin Akiyama, Jorge Urrutia
    Simple alternating path problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:101-103 [Journal]
  11. Nicola Martinov
    A recursive characterization of the 4-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:105-108 [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