The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2001, volume: 239, number: 1-3

  1. Tara S. Holm
    On majority domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:1-12 [Journal]
  2. Karina Marcus, András Sebö
    Integer multiflows and metric packings beyond the cut condition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:13-31 [Journal]
  3. Erich Neuwirth
    Recursively defined combinatorial functions: extending Galton's board. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:33-51 [Journal]
  4. Jean-Luc Rullière, Stéphan Thomassé
    Countable alpha-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:53-67 [Journal]
  5. Yan Wang, Bolian Liu
    The sum number and integral sum number of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:69-82 [Journal]
  6. Rudolf Winkel
    A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:83-99 [Journal]
  7. Arie Bialostocki, William Voxman
    Generalizations of some Ramsey-type theorems for matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:101-107 [Journal]
  8. Ezra Brown, Theresa P. Vaughan
    Cycles of directed graphs defined by matrix multiplication (mod n). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:109-120 [Journal]
  9. Masaaki Harada
    An extremal ternary self-dual [28, 14, 9] code with a trivial automorphism group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:121-125 [Journal]
  10. Jochen Harant, Mirko Horák, Zdzislaw Skupien
    Separating 3-cycles in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:127-136 [Journal]
  11. Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu
    The integral sum number of complete bipartite graphs Kr, s. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:137-146 [Journal]
  12. Dhruv Mubayi, Todd G. Will, Douglas B. West
    Realizing degree imbalances in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:147-153 [Journal]
  13. Artem V. Pyatkin
    New formula for the sum number for the complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:155-160 [Journal]
  14. Romeo Rizzi
    On the recognition of P4-indifferent graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:161-169 [Journal]
  15. Sara Nadiv Soffer
    Graphs with many large degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:171-177 [Journal]
  16. Baogen Xu
    On signed edge domination numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:179-189 [Journal]
  17. Jian-Zhou Zhang, Zhi-sheng You, Zheng-Liang Li
    Enumeration of binary orthogonal arrays of strength 1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:191-198 [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