The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1998, volume: 191, number: 1-3

  1. Horst Sachs
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:1-2 [Journal]
  2. Thomas Andreae
    On the clique-transversal number of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:3-11 [Journal]
  3. Luitpold Babel
    Tree-like P4-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:13-23 [Journal]
  4. Thomas Böhme, Jochen Harant
    On Hamiltonian cycles in 4- and 5-connected plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:25-30 [Journal]
  5. Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
    A planarity criterion for cubic bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:31-43 [Journal]
  6. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    On kernel-perfect orientations of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:45-49 [Journal]
  7. Mieczyslaw Borowiecki, Danuta Michalak
    Generalized independence and domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:51-56 [Journal]
  8. Jan Brousek
    Minimal 2-connected non-hamiltonian claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:57-64 [Journal]
  9. Guantao Chen, András Gyárfás, Richard H. Schelp
    Vertex colorings with a distance restriction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:65-82 [Journal]
  10. Igor Fabrici, Stanislav Jendrol
    Subgraphs with restricted degrees of their vertices in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:83-90 [Journal]
  11. Harald Gropp
    On configurations and the book of Sainte-Laguë. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:91-99 [Journal]
  12. Gregory Gutin, Benny Sudakov, Anders Yeo
    Note on alternating directed cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:101-107 [Journal]
  13. Heiko Harborth
    Empty triangles in drawings of the complete graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:109-111 [Journal]
  14. Arnfried Kemnitz, Halka Kolberg
    Coloring of integer distance graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:113-123 [Journal]
  15. Alexandr V. Kostochka, Michael Stiebitz
    Colour-critical graphs with few edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:125-137 [Journal]
  16. Jan Kratochvíl, Zsolt Tuza, Margit Voigt
    Complexity of choosing subsets from color sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:139-148 [Journal]
  17. Peter Mihók, Jozef Bucko, Margit Voigt
    On uniquely partitionable planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:149-158 [Journal]
  18. Bert Randerath, Lutz Volkmann
    Characterization of graphs with equal domination and covering number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:159-169 [Journal]
  19. Zdenek Ryjácek, Ingo Schiermeyer
    2-factors and hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:171-177 [Journal]
  20. Annette Schelten, Uwe Schelten
    Neighborhood conditions for graphs with induced claws. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:179-189 [Journal]
  21. Annette Schelten, Ingo Schiermeyer
    Ramsey numbers r(K3, G) for G =~ K7 - 2P2 and G =~ K7 - 3P2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:191-196 [Journal]
  22. Peter Smutný, Michal Tkác
    On cubic polyhedral graphs with prescribed adjacency properties of their faces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:197-206 [Journal]
  23. Jerzy Topp, Preben D. Vestergaard
    Interpolation theorems for domination numbers of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:207-221 [Journal]
  24. Heinz-Jürgen Voss
    Sachs triangulations and infinite sequences of regular maps on given type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:223-240 [Journal]
  25. Walter Wessel
    A short solution of Heawood's empire problem in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:241-245 [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