The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1983, volume: 44, number: 3

  1. David W. Bange, Anthony E. Barkauskas, Peter J. Slater
    Sequentially additive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:235-241 [Journal]
  2. C. C. Chen, P. Manalastas
    Every finite strongly connected digraph of stability 2 has a Hamiltonian path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:243-250 [Journal]
  3. Ales Drápal
    On quasigroups rich in associative triples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:251-265 [Journal]
  4. E. J. Farrell
    Forest decompositions of ladders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:267-274 [Journal]
  5. Herbert Fleischner
    Even cycles with prescribed chords in planar cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:275-280 [Journal]
  6. Gena Hahn, Dominique Sotteau, H. Sun
    Short cycles in mediate graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:281-284 [Journal]
  7. C. J. Liu, Yutze Chow
    An operator approach to some graph enumeration problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:285-291 [Journal]
  8. Bruce E. Sagan
    A note on Abel polynomials and rooted labeled forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:293-298 [Journal]
  9. M. G. Stone, R. H. Weedmark
    On representing Mn's by congruence lattice of finite algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:299-308 [Journal]
  10. Henk Jan Veldman
    Existence of Dlambda-cycles and Dlambda-paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:309-316 [Journal]
  11. Geoffrey Exoo
    On line disjoint paths of bounded length. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:317-318 [Journal]
  12. Jerald A. Kabell
    A note on colorings of finite planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:319-320 [Journal]
  13. Fred R. McMorris, G. T. Myers
    Some uniqueness results for upper bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:321-323 [Journal]
  14. Doron Zeilberger
    Andre's reflection proof generalized to the many-candidate ballot problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:325-326 [Journal]
  15. P. J. Owens
    Bipartite cubic graphs and a shortness exponent. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:327-330 [Journal]
  16. Aviezri S. Fraenkel
    Problem 38. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:331-333 [Journal]
  17. Aviezri S. Fraenkel
    Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:333- [Journal]
  18. Aviezri S. Fraenkel
    Problem 40. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:333-334 [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