The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Discrete Mathematics
1996, volume: 150, number: 1-3

  1. András Hajnal, Gyula O. H. Katona, Attila Sali
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:1- [Journal]
  2. Jaromir Abrham, Anton Kotzig
    Graceful valuations of 2-regular graphs with two components. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:3-15 [Journal]
  3. Krystyna T. Balinska, Louis V. Quintas
    Degrees in a digraph whose nodes are graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:17-29 [Journal]
  4. Curtis A. Barefoot, L. H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza
    Cycle-saturated graphs of minimum size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:31-48 [Journal]
  5. Arie Bialostocki, Hanno Lefmann, Terry Meerdink
    On the degree of regularity of some equations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:49-60 [Journal]
  6. Miklós Bóna, Géza Tóth
    A Ramsey-type problem on right-angled triangles in space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:61-67 [Journal]
  7. Myung S. Chung, Douglas B. West
    Large 2P3-free graphs with bounded degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:69-79 [Journal]
  8. György Csizmadia
    Furthest neighbours in space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:81-88 [Journal]
  9. Paul Erdös, Tibor Gallai, Zsolt Tuza
    Covering and independence in triangle structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:89-101 [Journal]
  10. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
    Graph spectra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:103-113 [Journal]
  11. Odile Favaron
    Least domination in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:115-122 [Journal]
  12. Alfred Geroldinger, Rudolf Schneider
    The cross number of finite abelian groups III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:123-130 [Journal]
  13. Ivan Gutman, Aleksandar Ivic
    On Matula numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:131-142 [Journal]
  14. Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther
    5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:143-153 [Journal]
  15. Penny E. Haxell
    Atoms of set systems with a fixed number of pairwise unions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:155-166 [Journal]
  16. Wilfried Imrich, Janez Zerovnik
    On the weak reconstruction of Cartesian-product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:167-178 [Journal]
  17. Stanislav Jendrol, Michal Tkác, Zsolt Tuza
    The irregularity strength and cost of the union of cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:179-186 [Journal]
  18. Hal A. Kierstead, Vojtech Rödl
    Applications of hypergraph coloring to coloring graphs not inducing certain trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:187-193 [Journal]
  19. Martin Klazar
    Extremal functions for sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:195-203 [Journal]
  20. Katalin Kolossa
    On the on-line chromatic number of the family of on-line 3-chromatic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:205-230 [Journal]
  21. Dieter Kratsch, Jenö Lehel, Haiko Müller
    Toughness, hamiltonicity and split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:231-245 [Journal]
  22. Marek Kubale, Konrad Piwakowski
    A linear time algorithm for edge coloring of binomial trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:247-256 [Journal]
  23. Monique Laurent
    Hilbert bases of cuts. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:257-279 [Journal]
  24. Tamás Lengyel
    On some properties of the series Sumk=0infinity knxk and the Stirling numbers of the second kind. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:281-292 [Journal]
  25. Rafaï Mourad Madani
    Characterization of Laborde-Mulder graphs (extended odd graphs). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:293-301 [Journal]
  26. Snezana Matic-Kekic, Dragan M. Acketa, Jovisa D. Zunic
    An exact construction of digital convex polygons with minimal diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:303-313 [Journal]
  27. Michael D. Plummer
    Extending matchings in planar graphs V. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:315-324 [Journal]
  28. Norbert Polat
    Stable graphs for a family of endomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:325-335 [Journal]
  29. Dragos Radu Popescu
    Une méthode d'énumération des cycles négatifs d'un graphe signé. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:337-345 [Journal]
  30. Marek Raczunas, Piotr Chrzastowski-Wachtel
    A Diophantine problem of Frobenius in terms of the least common multiple. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:347-357 [Journal]
  31. Jean-François Saclé
    Lower bounds for the size in four families of minimum broadcast graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:359-369 [Journal]
  32. Shin-ichi Tokunaga
    On a straight-line embedding problem of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:371-378 [Journal]
  33. Katalin Vesztergombi
    The two largest distances in finite planar sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:379-386 [Journal]
  34. Hansjoachim Walther
    A nonhamiltonian five-regular multitriangular polyhedral graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:387-392 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002