The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2000, volume: 219, number: 1-3

  1. Béla Bollobás, Oliver Riordan
    Polychromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:1-7 [Journal]
  2. Mieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska
    Minimal reducible bounds for 1-nonouterplanar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:9-15 [Journal]
  3. Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang
    Clique covering the edges of a locally cobipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:17-26 [Journal]
  4. Bruce N. Cooperstein
    A combinatorial construction of a graph with automorphism group SO+(2n, 2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:27-35 [Journal]
  5. B. Corbas, Graham D. Williams
    Congruence classes in M3(Fq) (q odd). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:37-47 [Journal]
  6. Steven T. Dougherty, Masaaki Harada, Patrick Solé
    Shadow lattices and shadow codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:49-64 [Journal]
  7. Ioana Dumitriu
    On generalized Tribonacci sequences and additive partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:65-83 [Journal]
  8. Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
    Bipartite Ramsey numbers and Zarankiewicz numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:85-95 [Journal]
  9. Wolfgang Haas
    Lower bounds for q-ary codes of covering radius one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:97-106 [Journal]
  10. Günter Heinz
    Lower and upper bounds on the total weight of semi-rich acyclic arrangements of oriented lines in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:107-122 [Journal]
  11. Robert Johansson
    On the bipartite case of El-Zahárs conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:123-134 [Journal]
  12. Liying Kang, Mao-cheng Cai
    Upper minus domination in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:135-144 [Journal]
  13. Hal A. Kierstead
    Extending partial colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:145-152 [Journal]
  14. Khee Meng Koh, Eng Guan Tay
    On optimal orientations of G vertex-multiplications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:153-171 [Journal]
  15. Clement W. H. Lam, Ying Miao
    Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:173-185 [Journal]
  16. Max Landsberg
    Feedback functions for generating cycles over a finite alphabet. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:187-194 [Journal]
  17. Rao Li
    A Fan-type condition for claw-free graphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:195-205 [Journal]
  18. Alan C. H. Ling, Charles J. Colbourn
    Modified group divisible designs with block size four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:207-221 [Journal]
  19. Hua Peng, Catherine Huafei Yan
    On the discrepancy of strongly unimodular matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:223-233 [Journal]
  20. Takao Ueda
    Gray codes for necklaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:235-248 [Journal]
  21. Xiaomin Bao
    On the blocking sets in S(3, 6, 22) and S(4, 7, 23). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:249-252 [Journal]
  22. Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    Solution to a problem on degree sequences of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:253-257 [Journal]
  23. Rajendra S. Deodhar, Murali K. Srinivasan
    Explicit semisymmetric chain decomposition of the partition lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:259-264 [Journal]
  24. Laura L. Dolph, Annmarie Reynolds, James A. Sellers
    Congruences for a restricted m-ary partition function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:265-269 [Journal]
  25. Keith J. Edwards
    Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:271-274 [Journal]
  26. John Gimbel, Carsten Thomassen
    Coloring triangle-free graphs with fixed size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:275-277 [Journal]
  27. Solomon W. Golomb, Guang Gong, Zong-Duo Dai
    Cyclic inequivalence of cascaded GMW-sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:279-285 [Journal]
  28. Sandi Klavzar, Riste Skrekovski
    On median graphs and median grid graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:287-293 [Journal]
  29. Frank Göring
    Short proof of Menger's Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:295-296 [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