The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1999, volume: 194, number: 1-3

  1. Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant, Victor Neumann-Lara
    Tightness problems in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:1-11 [Journal]
  2. Rafael Ayala, M. J. Chávez, A. Márquez, Antonio Quintero
    On the connectivity of infinite graphs and 2-complexes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:13-37 [Journal]
  3. Stanislaw Bylka, Adam Idzik, Zsolt Tuza
    Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:39-58 [Journal]
  4. Bor-Liang Chen, Lei Dong, Qi Zhang Liu, Kuo-Ching Huang
    Total colorings of equibipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:59-65 [Journal]
  5. György Csizmadia
    The multiplicity of the two smallest distances among points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:67-86 [Journal]
  6. David A. Drake, G. H. John van Rees, W. D. Wallis
    Maximal sets of mutually orthogonal Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:87-94 [Journal]
  7. Jürgen Eckhoff
    The maximum number of triangles in a K4-free graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:95-106 [Journal]
  8. Peter Gibson, Roy Maltby
    Posets in which every cutset meets every fibre. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:107-127 [Journal]
  9. T. Aaron Gulliver, Masaaki Harada
    Extremal double circulant Type II codes over Z4 and construction of 5-(24, 10, 36) designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:129-137 [Journal]
  10. Yuanqiu Huang, Yanpei Liu
    The maximum genus of graphs with diameter three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:139-149 [Journal]
  11. François Laviolette, Norbert Polat
    Spanning trees of countable graphs omitting sets of dominated ends. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:151-172 [Journal]
  12. John W. Leo
    Triads and triangles in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:173-193 [Journal]
  13. Roy Maltby
    Every cutset meets every fibre in certain poset products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:195-203 [Journal]
  14. Michel Serfati
    The lattice theory of r-ordered partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:205-227 [Journal]
  15. Olivier du Merle, Daniel Villeneuve, Jacques Desrosiers, Pierre Hansen
    Stabilized column generation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:229-237 [Journal]
  16. Christian Choffrut, Massimiliano Goldwurm
    Determinants and Möbius functions in trace monoids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:239-247 [Journal]
  17. Maurice Cochand, Gyula Károlyi
    On a graph colouring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:249-252 [Journal]
  18. Yuangqiu Huang
    Maximum genus and girth of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:253-259 [Journal]
  19. André E. Kézdy, Chi Wang
    Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:261-265 [Journal]
  20. Frank Rhodes, Robert A. Melter
    Geodetic metrizations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:267-279 [Journal]
  21. Bhalchandra D. Thatte
    A reconstruction problem related to balance equations II: The general case. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:281-284 [Journal]
  22. Baogen Xu
    On integral sum graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:285-294 [Journal]
  23. Rui Xu
    Some Ore-type conditions for the existence of connected [2, k]-factors in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:295-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