The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1990, volume: 85, number: 1

  1. David W. Barnette
    Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:1-16 [Journal]
  2. Klaus Bongartz, Detlef Mertens
    On the enumeration of Homeochromatic classes of k-chromatic tilings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:17-42 [Journal]
  3. Mao-cheng Cai
    The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:43-52 [Journal]
  4. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Subgraphs of minimal degree k. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:53-58 [Journal]
  5. George R. T. Hendry
    Extending cycles in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:59-72 [Journal]
  6. Alexander V. Karzanov
    Packings of cuts realizing distances between certain vertices in a planar graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:73-87 [Journal]
  7. Maolin Zheng, Xiaoyun Lu
    On the maximum induced forests of a connected cubic graph without triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:89-96 [Journal]
  8. Norbert Polat
    On the existence of minimal end-separators. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:97-98 [Journal]
  9. Hortensia Galeana-Sánchez
    On the existence of (k, l)-kernels in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:99-102 [Journal]
  10. András Gyárfás
    A simple lower bound on edge coverings by cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:103-104 [Journal]
  11. Mulan Liu
    Homomorphisms and automorphisms of 2-D de Bruijn-Good graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:105-109 [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