The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2000, volume: 212, number: 1-2

  1. Jens-P. Bode, Heiko Harborth
    Hexagonal polyomino achievement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:5-18 [Journal]
  2. Mieczyslaw Borowiecki, Izak Broere, Peter Mihók
    Minimal reducible bounds for planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:19-27 [Journal]
  3. Gilles Caporossi, Pierre Hansen
    Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:29-44 [Journal]
  4. Dragos Cvetkovic
    On the reconstruction of the characteristic polynomial of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:45-52 [Journal]
  5. Walter A. Deuber, Alexandr V. Kostochka
    On degrees of vertices in paradoxical trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:53-59 [Journal]
  6. Igor Fabrici, Erhard Hexel, Stanislav Jendrol, Hansjoachim Walther
    On vertex-degree restricted paths in polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:61-73 [Journal]
  7. Patrick W. Fowler, Arnout Ceulemans, Liviu F. Chibotaru
    Eigenvalues of Hückel systems of equivalent points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:75-90 [Journal]
  8. Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo
    Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:91-100 [Journal]
  9. Mirko Hornák, Stanislav Jendrol
    On vertex types and cyclic colourings of 3-connected plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:101-109 [Journal]
  10. Stanislav Jendrol, Heinz-Jürgen Voss
    A local property of polyhedral maps on compact two-dimensional manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:111-120 [Journal]
  11. Antoni Marczyk, Günter Schaar
    On traceable powers of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:121-128 [Journal]
  12. Mariusz Meszka, Zdzislaw Skupien
    On some third parts of nearly complete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:129-139 [Journal]
  13. Ingo Schiermeyer, Zsolt Tuza, Margit Voigt
    On-line rankings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:141-147 [Journal]
  14. Jerzy Topp, Preben D. Vestergaard
    alphak- and gammak-stable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:149-160 [Journal]
  15. Walter Wessel
    A short solution of Heawood's empire problem on the torus and implications for higher genus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:161-165 [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