The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1985, volume: 54, number: 1

  1. Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl
    On the use of senders in generalized ramsey theory for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:1-13 [Journal]
  2. Marc J. Lipman
    Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:15-21 [Journal]
  3. Bojan Mohar
    Akempic triangulations with 4 odd vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:23-29 [Journal]
  4. P. P. Pálfy
    On the chromatic number of certain highly symmetric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:31-37 [Journal]
  5. Hans Jürgen Prömel, Bernd Voigt
    Canonizing Ramsey theorems for finite graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:49-59 [Journal]
  6. Alain Quilliot
    A retraction problem in graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:61-71 [Journal]
  7. S. B. Rao
    On regular and strongly-regular self-complementary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:73-82 [Journal]
  8. Gunther Schmidt, Thomas Ströhlein
    Relation algebras: Concept of points and representability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:83-92 [Journal]
  9. R. O. Shelton, R. P. Soni
    Chains and fixing blocks in irreducible binary sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:93-99 [Journal]
  10. M. L. H. Willems
    Semi Minkowski i-structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:101-106 [Journal]
  11. Feng Keqin
    A problem on algebraic graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:107-109 [Journal]
  12. B. Reed
    A note on the semi-strong perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:111-112 [Journal]
  13. Richard P. Anstee, Uppaluri S. R. Murty
    Matrices with forbidden subconfigurations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:113-116 [Journal]
  14. M. Preissmann
    A class of strongly perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:117-120 [Journal]
  15. Sándor Szabó
    A type of factorization of finite Abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:121-124 [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