The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2000, volume: 211, number:

  1. Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus
    Restrained domination in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:1-9 [Journal]
  2. Jean E. Dunbar, Dean G. Hoffman, Renu C. Laskar, Lisa R. Markus
    alpha-Domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:11-26 [Journal]
  3. Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein
    Equational characterizations of Boolean function classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:27-51 [Journal]
  4. C. Grant, Christopher A. Rodger
    An n to 2n embedding of incomplete idempotent latin squares for small values ofn. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:53-74 [Journal]
  5. Khee Meng Koh, Eng Guan Tay
    On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:75-102 [Journal]
  6. Germain Kreweras, Dominique Dumont
    Sur les anagrammes alternés. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:103-110 [Journal]
  7. Gangsong Leng, Yao Zhang, Bolin Ma
    Largest parallelotopes contained in simplices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:111-123 [Journal]
  8. Michael E. Mays, Jerzy Wojciechowski
    A determinant property of Catalan numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:125-133 [Journal]
  9. Miwako Mishima, Masakazu Jimbo
    Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:135-152 [Journal]
  10. Norbert Polat
    On infinite bridged graphs and strongly dismantlable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:153-166 [Journal]
  11. Jian Shen
    On the girth of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:167-181 [Journal]
  12. Adrian Dumitrescu, William L. Steiger
    On a matching problem in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:183-195 [Journal]
  13. Claude Berge, Bruce A. Reed
    Optimal packings of edge-disjoint odd cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:197-202 [Journal]
  14. Josep M. Brunat, Montserrat Maureso
    Endo-circulant digraphs of degree two and Cayley digraphs on finite abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:203-208 [Journal]
  15. Ernest J. Cockayne, Devon McCrea, Christina M. Mynhardt
    Nordhaus-Gaddum results for CO-irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:209-215 [Journal]
  16. Peter Dankelmann, Lutz Volkmann
    Degree sequence conditions for maximally edge-connected graphs depending on the clique number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:217-223 [Journal]
  17. Michael D. Hirschhorn
    Some formulae for partitions into squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:225-228 [Journal]
  18. Yuan Hong, Jin-Long Shu
    A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:229-232 [Journal]
  19. Brad Jackson, Gerhard Ringel
    Variations on Ringel's earth-moon problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:233-242 [Journal]
  20. Jaroslav Jezek, Petar Markovic, Miklós Maróti, Ralph McKenzie
    Equations of tournaments are not finitely based. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:243-248 [Journal]
  21. Robert Johansson
    Triangle-factors in a balanced blown-up triangle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:249-254 [Journal]
  22. Henry A. Kierstead
    On the choosability of complete multipartite graphs with part size three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:255-259 [Journal]
  23. Alon Nilli
    Triangle-free graphs with large chromatic numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:261-262 [Journal]
  24. Yoomi Rho
    An extremal problem concerning graphs not containing Kt and Kt, t. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:263-268 [Journal]
  25. Uwe Schnell
    FCC versus HCP via parametric density. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:269-274 [Journal]
  26. Jorge Jiménez Urroz
    Congruences for the partition function in certain arithmetic progressions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:275-280 [Journal]
  27. Kazuhiko Ushio
    Sk-factorization of symmetric complete tripartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:281-286 [Journal]
  28. Yuansheng Yang, Jianhua Lin, Chunli Wang, Kaifeng Li
    On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:287-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